Explain and compare two efficient implementations of a priority queue using binary tree.
Ilustrate this on an example of ascending priority queue that is created when elements
15, 38, 45, 21, 8, 55,20 are inserted and the two largest elements are deleted.
3. The Attempt at a Solution [/B]
Could someone give some guidance on this question?
I don't need code, just an explanation.