Question

Please finish all the questions,Thanks

Following is Appendix

assume the definition of Java class Heap given in the Appendix For this question, a. (2 marks Consider the following heap 30 12 20 19 6 10 18 Given the array representation of a heap discussed in class, what is the array that corre sponds to this heap? b. (5 marks) Successively insert into the heap of part (a.) 22, 35 and 11, in that order. Use the standard heap insertion algorithm. Show the resulting heap after each insertion, and intermediate working (3 marks) C. Delete the root of the heap resulting from the insertions of (b.) above. Use the standard heap deletion algorithm. Show the resulting heap, and intermediate working d. (3 marks) Consider again the values from the initial heap given in (a.) (i.e. 30, 20, 12, 19, 6, 5, 10, 18, 8). Assume you were given these values just heap, not necessarily using the heapInsert () operation. Is the heap given in (a.) the only possible heap? If so, explain why. If not, give an alternative heap as a set, and asked to construct a e. (8 marks) i (6 marks) Write a Java function defined as follows. The function should use a heap to determine the median of the items in an array of integers part of the Heap class.) (This function is not а. Float heapMed (Integer[] a) // pre: array 7/post: heapMed returns median of the items in a a of integers is non-empty i (2 marks) What is the worst-case time complexity of the function heapMed? APPENDIX Heap.java = 20 private static int maxHeap private static int[] items; private static int size; public Heap) { items = new int [maxHeap]; size 0; } public int size () { return size; private static void swap (int i, int j) { // swaps elements items [i] and items [j] int temp = items[i]; items [i] = items[j]; items [j } = temp; public int heapTop () { return items [0]; } public void heapInsert (int newItem) { if (size= 0) && / swap items [place] and items[parent] swap (place, parent); 7move up to parent place -D рarent; (place 1)/2; (items [place] > items[parent] )) (place 1)/2; parent } //end while ++size } } //end heap Insert

Answer 1

is Ansuen Reppesentakion of heap The anay a) 20 Insent 19 23 8 Oレ 12 22 20 5 Tasent 30 19

Insent 30 35 22 20 celete Toot I5 10 2 205

12 2o Io 22 10 20 le heap νοηςση is the max No the heap given the be can a lso Conshouct Sum heap out values 20,12,19, 6,s,o, 18, Heap NU 2 20 30