Suppose:

• n is the number of nodes in a maximully full and balanced binary tree, and
• h is its height.

h n 0 1 1 3 2 7 3 15 . . . . . . h 2h+1-1