A priority queue is implemented as a Max-Heap. Initially, it has 5 elements. The level-order traversal of the heap is: 10, 8, 5, 3, 2. Two new elements 1 and 7 are inserted into the heap in that order. The level-order traversal of the heap after the insertion of the elements is:

Question

Examsnet · Accepted Answer

Correct Answer is : 10, 8, 7, 3, 2, 1, 5

GATE Computer Science (CS) 2014 Shift 2 Solved Paper