Question: 1. Turn this tree into a max-at-top heap using the procedure outlined in lecture, and show the heap that is produced. 2. What is the
1. Turn this tree into a max-at-top heap using the procedure outlined in lecture, and show the heap that is produced.
2. What is the array representation of the max-at-top heap that you obtained in part 1?
3. Heapsort begins by turning the array to be sorted into a heap. Assume that your answer to part 2 is the result of this process of turning the original array into a heap.
What will the array look like after one element is put into its final position by heapsort i.e., at the end of the first iteration of the loop in heapSort()?
What will the array look like after the second element is put into its final position?
12 26 21 2035 4015 33)Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
