minimum and maximum numbers of elements in a heap of height h code example

Example: minimum and maximum numbers of elements in a heap of height h

Hence the minimum number of nodes possible in a heap of height h is 2h.
Clearly a heap of height h, has the maximum number of elements when its lowest level is completely filled.
In this case the heap is a complete binary tree of height h and hence has 2h+1 -1 nodes.