Multiple choice

Calculate the minimum number of nodes in AVL tree where height (H) is 8 and root at level 1.

  1. 56

  2. 54

  3. 58

  4. 64
Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

N(H min)=1+N(H-1)+N(H-2). For N(1)=1, for N(2)=2 , for N(3)= 1 + N(2 )+ N(1), it will become 1+2+1 = 4 and so on. So for N(8) it will be 54 and answer 54 is correct.  

Keep practicing — related questions