Q. What is a complete binary tree?

(A) Each node has exactly zero or two children
(B) A binary tree, which is completely filled, with the possible exception of the bottom level, which is filled from right to left
(C) A binary tree, which is completely filled, with the possible exception of the bottom level, which is filled from left to right
(D) A tree In which all nodes have degree 2

💬 Discuss

✅ Correct Answer: (C) A binary tree, which is completely filled, with the possible exception of the bottom level, which is filled from left to right

Published by Mr. Dubey ⭐ 111.42K Points at 16-Sep-2023 03:20 pm in Data Structure (DS)

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

642

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

86%

Success Rate