Skip to content
Related Articles
Get the best out of our app
GFG App
Open App
geeksforgeeks
Browser
Continue

Related Articles

Data Structures | Queue | Question 8

Improve Article
Save Article
Like Article
Improve Article
Save Article
Like 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:

10, 8, 7, 3, 2, 1, 5 will be the answer.


Quiz of this Question
Please comment below if you find anything wrong in the above post

My Personal Notes arrow_drop_up
Last Updated : 11 Feb, 2013
Like Article
Save Article
Similar Reads
Related Tutorials