-
A priority–queue is implemented as a max–heap. Initially, it has 5 elements. The level – order traversal of the heap is given below.
10, 8, 5, 3, 2
Two new elements 1 and 7 are inserted in the heap in that order. The level – order traversal of the heap after the insertion of the element is
-
- 10, 8, 7, 5, 3, 2, 1
- 10, 8, 7, 2, 3, 1, 5
- 10, 8, 7, 1, 2, 3, 5
- 10, 8, 7, 3, 2, 1, 5
- 10, 8, 7, 5, 3, 2, 1
Correct Option: D
Initial level order traversal with 10, 8, 5, 3, 2
Now, let us insert the values
Therefore, the level order traversal comes out to be 10, 8, 7, 3, 2, 1, 5
