GATE CS 2014 Max Heap insertion

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: 

1. 10,8,7,5,3,2,1
2. 10,8,7,2,3,1,5
3. 10,8,7,1,2,3,5
4. 10,8,7,3,2,1,5

View answer

4

Practice Problem

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 6 and 9 are inserted into the heap in that order. The level-order traversal of the heap after the insertion of the elements is____.