Question 41

A) Draw the binary max heap that results from inserting 15, 2, 4, 7, 3, 6, 12, 1, 5 in that order into an initially empty binary heap. You do not need to show the array representation of the heap. You are only required to show the final tree, although if you draw intermediate trees, please circle your final result for ANY credit.

B) Draw the result of doing 2 deletemaxs on the heap you created in part a. You are only required to show the final tree, although if you draw intermediate trees, please circle your final result for ANY credit.

C) Draw the array representation of the tree you drew at the end of step b above (after the two deletemaxs). You only need to fill in the parts of the array that hold valid data values.