Question

A max-heap with 10 elements is given in the following array format. The following three sub-questions all refer to this max heap.

i	1	2	3	4	5	6	7	8	9	10
A[i]	99	90	80	70	60	50	40	30	20	10

Show the result after applying heap-increase-key(A, 9, 95) to the max-heap at the top of this page:

i	1	2	3	4	5	6	7	8	9	10
A[i]

Show the result after applying heap-extract-max(A) to the max-heap at the top of this page:

i	1	2	3	4	5	6	7	8	9	10
A[i]

Show the result after applying max-heap-insert(A, 95) to the max-heap at the top of this page:

i	1	2	3	4	5	6	7	8	9	10
A[i]

The answer needs to be filled out in the tables please.

Answer 1

Answer -1

Answer - 2-

Answer - 3

for references please go through the code below

please wait sp,e modification are required

void MinHeap: :decreasekey(int i, int new_val) harr[1] new-val; while (i !- 0 &&harr[parent(i)] > harr[i]) swap (&harr[i], 1 = parent (i); &harr[parent(i)]);

void MinHeap::insertKey(int k) if (heap_sizecapacity) cout << "noverflow: Could not insertkey In"; return / First insert the new key at the end heap_size++; int i heapsize - 1; harr[i]k; - // Fix the min heap property if it is violated while (i!- 0 && harr[parent(i)] harr[i]) swap(&harr[i], &harr[parent (i)]); i - parent (i);

int MinHeap: :extractMin() (heap-size <= 0) return INT_MAX; (heap-size-1) if if heap_size--; return harr[0]; // Store the minimum value, and int root = harr[0]; harr[0] = harr[heap-size-1]; heap_size--; MinHeapify(0); remove it from heap return root;