I want to implement a Priority Queue using the following Max Heap: [None, 33, 27, 23, 7, 15, 18, 21, 6, 2, 3, 1, 8]
What should be the state of the heap after I serve an element from the queue?

Question

I want to implement a Priority Queue using the following Max Heap: [None, 33, 27, 23, 7, 15, 18, 21, 6, 2, 3, 1, 8]  
 What should be the state of the heap after I serve an element from the queue?

Answer

[ None , 23, 27, 18, 7, 15, 8, 21, 6, 2, 3, 1]

Answer

[ None , 27, 15, 23, 7, 8, 18, 21, 6, 2, 3, 1]

Answer

[ None , 27, 23, 7, 15, 18, 21, 6, 2, 3, 1, 8]

Answer

[ None , 33, 27, 23, 7, 15, 18, 21, 6, 2, 3, 1]

Crowdly

I want to implement a Priority Queue using the following Max Heap: [None, 33, ...

Want instant access to all verified answers on learning.monash.edu?