Theare are many ways to implement to implement a priority queue.
1. Using Heap (max or min)
2. Using singly linked list and a list header which has informations like first node
address and last node address within the header.
Along with this information header also contains current priority which is being executed.
Every time, list is traversed and process nodes associated with that priority.