Question

14 18 11 10 19 16 23 28 15 21 Again, recall that in a Java program, a binary heap is stored as an array with the first element in position [O] unused, in order to simplify the swim() and sink() operations. Let us denote the unused element of the array with the symbol "#". Therefore, the above complete binary tree will be represented by the following array: T[ 0..13 ] = [ #, 5, 6, 7, 14, 18, 11, 10, 19, 16, 23, 28, 15, 21 ] Since the "Canvas Answer Editor" neither allows drawing diagrams similar to the above complete binary tree nor creating a table to represent an array of more than 10 elements, please use the above T[#...] notation to give your answer to the following question: Show below the result of applying the delete Min(.) operation, which removes the minimum element of the Heap (i.e. the corresponding priority queue stored in the Min-Heap).

Answer 1

Steps to delete an element in min heap:

1. Delete the node that contains the value you want deleted in the heap.

2. Replace the deleted node with the farthest right node.

3. Heapify (Fix the heap):

if the heap property holds true

then you are done.

else if the replacement node value its parent nodes value then swap them, and repeat step 3.

else

swap the replacement node with the smallest child node, and repeat step 3.

output:

T[0..12]=[#,6,14,7,16,18,11,10,19,21,23,28,15]