A max heap is a complete binary tree such that for all its parent/child pairs, parents value >= childs value. Given an empty max heap. Show the heap after inserting these values in this order into the heap:

7, 16, 49, 82, 5, 31

I strongly recommend that you show the heap after reach of the six insertions. That way, if you make a mistake for one of the insertions, Ill be able to give you credit for the other insertions that are correct. On the other hand, if you just show the final heap, and its wrong, then it will be much more difficult for me to award partial credit.