A priority queue is implemented as a Max-Heap. Initially, it has 5 elements.…

PYQ GATE 2014PYQ GATE 2005

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. A.

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

  2. B.

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

  3. C.

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

  4. D.

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

Attempted by 495 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…