A binary tree of depth "d" is an almost complete binary tree if __________.

M

Mr. Dubey

🎓 Coach ⭐ 103.11K Points

📊 Data Structure (DS)

Q. A binary tree of depth "d" is an almost complete binary tree if __________.

(A) each leaf in the tree is either at level.
(B) for any node.
(C) both a and b.
(D) None.

💬 Discuss

✅ Correct Answer: (C) both a and b.

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

777

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

94%

Success Rate