previous | index | next

Maximum Leaves

We can prove that leaves(h) = 2h by induction on h.

Base step: When h = 0, there is only one node in the tree and it is a leaf. This is correct because leaves(0) = 20 = 1.


previous | index | next