Data Structures

1: 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 of these
 

Answer : C

Explanation :

Write your comments here:


Report Error
 

Option: A

Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here.