A priority queue is an abstract data type which is like a regular queue or some other data

structures, but where additionally each element $($node$)$ has a "priority" associated with it$.$ In a

priority queue, an element with high priority is served before an element with low priority like

scheduler.

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