dont use tabs In a max heap (largest value at the root), when we call deleteMax, the root is replaced by the last item in the heap and "trickles down" to the correct position. In the binary heap below, the last item happens to be 1. Replace the X's with actual positive values (no duplicates), so you have a legal max heap and after each of the 4 calls to deleteMax, the number 1 trickles down to the last position again. "Draw" the resulting heap after each deleteMax. (You might want to copy over your original heap four times instead of entering the numbers again.) Original Heap:   

 After first deleteMax:  After second deleteMax:  After third deleteMax:  After fourth deleteMax: