Question

How do you find the maximum height of an AVL tree

Answer 1

Hyy Dude

Minimum Nodes in an AVL tree with height n is H(n)=H(n−1)+H(n−2)+1. H(0)=1. H(3)=H(2)+H(1)+1=4+2+1=7. So, the max height with 7 nodes is 3.

Hope it's helps you

Plz marked in brainlest answer