A Fibonacci tree can be considered the worst case AVL tree in that it has the smallest number of nodes among AVL trees of height h. Draw Fibonacci trees for h = 1,2,3,4 and justify the name of the tree.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.