The fewest possible number of nodes in an AVL tree of height h

is $\backslash$Theta

$(\_\_\_\_\_\_\_\_\_)$

Question $8$Answer

a$.$

$((1+5)/2)$h

b$.$

hlogh

c$.$

$2$h$/2$

d$.$

$2$h