Sponsored Link •
|
Advertisement
|
Advertisement
|
This page contains an archived post to the Java Answers Forum made prior to February 25, 2002. If you wish to participate in discussions, please visit the new Artima Forums.
Message:
How do I start implementing a priority queue using a singly linked list which tests is the queue is empty and returns a boolean value of true if it is and false otherwise. which inserts the item X into the queue Q according to the prioprity of x which returns the greatest prioprity item in the queue(without deletion) which deletes the greatest prioprity item. which displays the contents of the queue which tests if item X is in queue Q which merges the queues Q,R preserving priority. I appreciate your help greatly. Replies:
|
Sponsored Links
|