Aspire Faculty ID #17214 · Topic: AMU MCA 2020 · Just now
AMU MCA 2020

The minimum number of nodes in an AVL tree of height 6 is

Solution

Minimum nodes follow Fibonacci relation:

$N(h)=N(h-1)+N(h-2)+1$

$N(6)=20$

Previous 10 Questions — AMU MCA 2020

Nearest first

Next 10 Questions — AMU MCA 2020

Ascending by ID
Ask Your Question or Put Your Review.

loading...