Question: Heapify the following using the algorithm we outlined in class. The heap should have the maximum element at the top of the heap.
35 57 53 26 50 15 22 21 25 14 11 2
Answer: As you move from the bottom of the heap to the top, all subtrees are in heap order already until you get to the very top node. This will require some swaps. You get the following.
57 50 53 26 35 15 22 21 25 14 11 2