Question: A priority queue is implemented as a linked list, sorted from largest to smallest element. 1. How would the definition of PQType change? 2. Write
A priority queue is implemented as a linked list, sorted from largest to smallest element. 1. How would the definition of PQType change? 2. Write the Enqueue operation using this implementation. 3. Write the Dequeue operation using this implementation. 4. Compare the Enqueue and Dequeue operations to those for the heap implementation, in terms of Big-O notation.
Step by Step Solution
3.48 Rating (164 Votes )
There are 3 Steps involved in it
1 The definition of PQType In the linked list implementation each element in the priority queue has to hold the data and also the link to the next ele... View full answer
Get step-by-step solutions from verified subject matter experts
