Question

Formula to find no of nodes in avl and binary tree

Answer 1

For height = 0, we can only have a single nodein an AVL tree, i.e. n(0) = 1.

For height = 1, we can have a minimum of two nodes in an AVL tree, i.e. n(1) = 2.

Now for any height 'h', root will have two subtrees (left and right).