AVL Tree:
Using the recursive function N(h) = 1 + N(h-1) + N(h-2) we can find the minimum number of nodes in any given AVL tree of height h.
64.3k questions
77.9k answers
244k comments
80.0k users