A.  any node nd at level less than d1 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 
Option: A Explanation : Click on Discuss to view users comments. 
A.  II and III 
B.  I and III 
C.  I and II 
D.  None of these 
Option: B Explanation : Click on Discuss to view users comments. 
A.  each leaf in the tree is either at level 
B.  for any node 
C.  both a and b 
D.  None of these 
Option: C Explanation : Click on Discuss to view users comments. 
A.  Complete tree 
B.  Full binary tree 
C.  Binary search tree 
D.  AVL tree 
Option: C Explanation : Click on Discuss to view users comments. 
A.  15 
B.  20 
C.  63 
D.  71 
Option: C Explanation : Click on Discuss to view users comments. Pankaj said: (10:38am on Tuesday 29th January 2013)
calculating formula for no of node in complete binary is 2h1 2^51 = 31 Node why 63 plz explain
Pankaj said: (10:39am on Tuesday 29th January 2013)
calculating formula for no of node in complete binary is 2h1 2^51 = 31 Node why 63 plz explain
Sajida said: (8:50am on Wednesday 14th December 2016)
calculating formula for no of node in complete binary is 2(h 1)1 2^(5 1 )1=2^61=641=63
Sidharth Singh said: (8:29am on Saturday 8th April 2017)
Here level is given as 5 so deapth = level 1Then calculate it will be 63
