Awesome q2a theme
0 votes
11 views

A Priority – Queue initially has $5$ elements and is implemented as a Max Heap. The level – order traversal of the heap is: $11, 9, 6, 4, 3.$ Two new elements $2$ and $8$ are inserted in the heap in that order. The level – order traversal of the heap after the insertion of the elements is:

  1. $11, 9, 8, 4, 3, 2, 6$
  2. $11, 9, 8, 6, 4, 3, 2$
  3. $11, 9, 8, 3, 4, 2, 6$
  4. $11, 9, 8, 2, 3, 4, 6$
in Others by (178 points) | 11 views

1 Answer

+1 vote
Best answer

Option A is the correct answer

by (419 points)
selected by
932 questions
596 answers
1,885 comments
81,474 users