Priority Queue Implementation in C/C++?

Question

An element with high priority is appears before low priority element, can someone help me to write the Priority Queue Implementation?

Thanks in advance?

Comments

Priority queue is a datastructure which is like a regular queue or stack data structure, but where additionally each element has a “priority” associated with it.

In a priority queue, an element with high priority is served before an element with low priority.

If two elements have the same priority, they are served according to their order in the queue.

I hope this helps...

Answer 1

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.