Queues are FIFO data structures, that means that the first element that is placed in the queue is also the first one that is taken off. Obviously linked lists are natural candidates to implement queues. Queues typically have two methods (i) enqueue (adds an element to the list) and (ii) dequeue (removes the first element from the list).

A priority queue is one in which elements are queued based upon their priority. Elements with the highest priority should be first off, followed by lower priority elements. If two elements have similar priorities, then the one that joined the queue first should be taken off before the later arriving element. Implement java program for a Generic priority queue (PriorityQueue) for Comparable objects using a modified linked list as the basis for your priority queue.