# AVL tree

1 vote
1.9k views
minimum no of nodes n AVL tree of height 11 is
a)230  b)231  c)232 c)233

Ans should be C) 232  (assume root at height 1)

edited by
1
I think with H=1, we need to have at least 2 node

and with H=0,  N(0)= 1

N(1)=2

And rest procedure is correct but your ans is for h=10 , so for h=11

N(11)= 1 + N(10) + N(9)

= 1 + 232 + 143

= 376
0
it will be correct , if i assume root node at hight 0 , but i assume root at height 1 so at height 1 no of node is only 1 which is root only ..( i mentioned in diagram )

as here not given what is height of root ... i assumed according to option ...

so ans 232 is correct :)
3
If you are assuming according to the options given then its alright but in general definition of Height of a tree says root has zero height.

I think You can assume level of root as 1 or 0.
0
Well the answer is based on assumption that Height=1 at Root, but usually we follow root at height 0.

## Related questions

1
1.2k views
Let T be a binary search tree with n nodes and Sn be the average number of comparisons required for successful search and Un be the average number of comparison required for an unsuccessful search. Then what is the relation between Sn, Un and n