Question

A priority queue is implemented as a max-heap initially, it has five elements. The level-order traversal of the heap is as follows:
20, 18, 15, 13, 12
Two new elements '10' and '17' are inserted in the heap in that order, The level-order traversal of the heap after the insertion of the element is

• A. 20, 18, 17, 12, 13, 10, 15
• B. 20, 18, 17, 13, 12, 10, 15
• C. 20, 18, 17, 15, 13, 12, 10
• D. 20, 18, 17, 10, 12, 13, 15

Answer 1

The correct option is B 20, 18, 17, 13, 12, 10, 15