-
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 :
-
- 10, 8, 7, 3, 2, 1, 5
- 10, 8, 7, 2, 3, 1, 5
- 10, 8, 7, 1, 2, 3, 5
- 10, 8, 7, 5, 3, 2, 1
- 10, 8, 7, 3, 2, 1, 5
Correct Option: A
After insertion of elements, level - order tansvasal is: 10, 8, 7, 3, 2, 1, 5
