Question discussion

The minimum number of nodes in an AVL tree of height 4 (a tree with a single node has height 0) is

1359Medium DSSSB TGT Computer Science 0 replies 1 views

Correct answer: C

Explanation

With N(h) = N(h−1) + N(h−2) + 1, N(0) = 1 and N(1) = 2, we get N(2) = 4, N(3) = 7 and N(4) = 12.

Nobody has replied yet. Start the discussion!