The height of a binary tree is the maximum number of edges in any root to leaf path. The maximum number of nodes in a binary tree of height $h$ is:
At maximum tree is given as above
So maximum height = 2 (15 - > 10 -> 8) or other all are same height
Put h = 2 in option and find number of nodes
A- 22 -1 = 3 wrong
B- 21-1 = 1 wrong
C- 23-1 = 7 correct
D- 23 = 8 wrong
SO option C is correct option
height H=0 ( only root node ) , no of node N=1=20
H=1 , N=21
... so on
total =20 +21+22+.......2H =2H+1-1
Ans is C
Please elucidate this really important...
There is one more problem. Ppl who have...