Login/RegisterData Structures :: Trees - Discussion
Home > Data Structures > Trees > MCQs Questions Discussion
15 / 194
Choose the correct option.
A binary tree of depth "d" is an almost complete binary tree if
AEach leaf in the tree is either at level “d†or at level “d–1â€
BFor any node “n†in the tree with a right descendent at level “d†all the left descendents of “n†that are leaves, are also at level “dâ€
CBoth (A) & (B)
DNone of the above
Answer: Option (Login/Signup)
Show Explanation
Asked In ::
No Discussion on this question yet!
