A priority queue is implemented as a heap:

1. Show how the heap would look after this series of operations:

 2. What would the values of x, y, and z be after the series of operations in part (a)?

Transcribed Image Text:

25 26 pq 24 27 5 15 56 3 42 19