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:
ans is (D)....whenever we insert an element in heap,it will always inserted in last level from left to right..so here we insert element $1$ and $7$ as a child of node $5$.then we perform heapify algorithm until we get the min/max heap..so here finally in above question we get the heap whose level order traversal is $10,8,7,3,2,1,5$
After insert of $1$
After insert of $7$
"A priority queue is implemented as a Max-Heap" has no use ??? dont you think A option is correct since after insertion queue will remain be priority queue .
Can we challenge this question?