In a complete binary tree, which property holds true?
A. All levels are completely filled except possibly the last level, which is filled from left to right.
B. All nodes have exactly two children.
C. The tree is perfectly balanced.
D. All nodes have only one child.
Answer: Option A
This Question Belongs to Data Structure >> Trees In Data Structures
Related Questions on Trees in Data Structures
A. Inorder
B. Preorder
C. Postorder
D. Level-order
Join The Discussion