previous | index | next

Maximum Nodes

Consider the second part:

nodes(h) = leaves(h) + nodes(h-1)

previous | index | next