A priority queue is implemented as a max heap. Initially the level order traversal of S elements of heap is
70, 50, 30, 20, 10
The new elements 3, 49 are inserted in heap, the level order traversal after insertion is
1
70, 50, 49, 30, 20, 10,3
2
70, 50, 49, 3, 10, 20, 30
3
70, 50, 49, 10, 20, 3, 30
4
70, 50, 49, 20, 10, 3, 30
5
Question Not Attempted