Given a max-priority queue A[1..8] = , consider calling Max-Heap-Insert (A, 15). MAX-HEAP-INSERT (4, k) 1...

Transcribed Image Text:

Given a max-priority queue A[1..8] = <25, 10, 17, 6, 9, 12, 16, 5>, consider calling Max-Heap-Insert (A, 15). MAX-HEAP-INSERT (4, k) 1 A.heapsize = A.heapsize + 1 2 A[A.heapsize] = =10 3 HEAP-INCREASE-KEY(A, A.heapsize, k) HEAP-INCREASE-KEY(A, i, k) 1 if k <A[i] 2 error "new key is smaller than current key" 3 A[i] = k 4 while i > 1 and A[PARENT(i)] <A[i] 5 6 swap A[i] with A[PARENT(i)] i = PARENT(i) What will be the resulting max-priority queue A? © 25, 10, 17, 6, 9, 12, 16, 5, 15 25, 10, 17, 15, 9, 12, 16, 5, 6 25, 15, 17, 10, 9, 12, 16, 5, 6 © 25, 17, 16, 15, 12, 10, 9, 6, 5 Given a max-priority queue A[1..8] = <25, 10, 17, 6, 9, 12, 16, 5>, consider calling Max-Heap-Insert (A, 15). MAX-HEAP-INSERT (4, k) 1 A.heapsize = A.heapsize + 1 2 A[A.heapsize] = =10 3 HEAP-INCREASE-KEY(A, A.heapsize, k) HEAP-INCREASE-KEY(A, i, k) 1 if k <A[i] 2 error "new key is smaller than current key" 3 A[i] = k 4 while i > 1 and A[PARENT(i)] <A[i] 5 6 swap A[i] with A[PARENT(i)] i = PARENT(i) What will be the resulting max-priority queue A? © 25, 10, 17, 6, 9, 12, 16, 5, 15 25, 10, 17, 15, 9, 12, 16, 5, 6 25, 15, 17, 10, 9, 12, 16, 5, 6 © 25, 17, 16, 15, 12, 10, 9, 6, 5

Answer rating: 100% (QA)

To perform the MaxHeapInsert operation on the given maxpriority queue A418 2510176912165 Wit... View the full answer