Iterating sub-heap formation from leaves to root
lThe leaves are already heaps by themselves.
lWe need to play the tournament (O(k) rounds at level k) n/2 times, corresponding to the non-leaves.

lCoarsely, Phase I is O(n log(n)) overall.
lIs this bound tight?