E. 12 points] Assuming that the above min-heap is the internal representation of a min-priority queue...

  

Transcribed Image Text:

E. 12 points] Assuming that the above min-heap is the internal representation of a min-priority queue (pq). What is the output of the following piece of code? cout < < pq.dequeue() cout < < pq.dequeue() pq.enqueue(0) cout < < pq.dequeue() cout < < pq.dequeue() 25 100 19 36 E. 12 points] Assuming that the above min-heap is the internal representation of a min-priority queue (pq). What is the output of the following piece of code? cout < < pq.dequeue() cout < < pq.dequeue() pq.enqueue(0) cout < < pq.dequeue() cout < < pq.dequeue() 25 100 19 36