Exercise 6.1.2
Show that an -element heap has height
This is way too obvious, that it is hard to prove it.
The number of internal nodes a complete binary tree has is where is the height of the tree. A heap of height has at least one additional node (otherwise it would be a heap of length ) and at most additional nodes (otherwise it would be a heap of length ), which is similar to the answer in exercise 6.1-1.
Thus, if , then the height will be .