Data Structures

1: A binary tree having n nodes and depth d will be about complete binary tree if
A. any node nd at level less than d-1 has two sons
B. it contains log(d)+1 nodes
C. for any node nd in the tree with a right descendent at level d lt must have a left son
D. all of these
 

Answer : A

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.