Using Figure 6.3 as a model, illustrate the operation of BUILD-MAX-HEAP on the array A = [5, 3, 17, 10, 84, 19, 6, 22, 9].
Why do we want the loop index i in line 2 of BUILD-MAX-HEAP to decrease from ⌞length[A]/2⌟ to 1 rather than increase from 1 to ⌞length[A]/2⌟?
如果先从1开始，它的子树并不是最大堆，肯定不能这样迭代.
If we start from 1, because its subtree is not a maximum heap, we can't follow this order.
Show that there are at most nodes of height h in any n-element heap.
According to 6.1.1we have
Mark h0 as the height of tree.
If the current layer is full, then we have equal. If in the leaf node and not full, we have less.
Follow @louis1992 on github to help finish this task.