Skip to content
Related Articles

Related Articles

GATE | GATE-CS-2005 | Question 34

Improve Article
Save Article
  • Last Updated : 28 Jun, 2021
Improve Article
Save Article

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 elements is:
(A) 10, 8, 7, 5, 3, 2, 1
(B) 10, 8, 7, 2, 3, 1, 5
(C) 10, 8, 7, 1, 2, 3, 5
(D) 10, 8, 7, 3, 2, 1, 5


Answer: (D)

Explanation: See question 4 of https://www.geeksforgeeks.org/data-structures-and-algorithms-set-22/

Quiz of this Question

My Personal Notes arrow_drop_up
Related Articles

Start Your Coding Journey Now!