Titsjgrosdnle Here

It is important to note that a priority queue only supports elements that are comparable. Elements are called comparable if they are either lesser than, equal to or greater than one another, i.e. if the two elements are a and b, they should follow one of the conditions:

It is important to note that a priority queue only supports elements that are comparable. Elements are called comparable if they are either lesser than, equal to or greater than one another, i.e. if the two elements are a and b, they should follow one of the conditions:

i) a

ii) a=b

iii) a>b

As a result, the items in the priority queue are arranged in ascending or descending order.

It is an Abstract Data Type that functions a little differently than a normal Queue. In a normal Queue, first-in-first-out is followed which means that whichever elements enters the queue first, will be the first to leave. Just like any queue we form, the person that stands first in the queue, will be addressed first and similarly, even in computer science queues, the same rule applies.

Characteristics of a Priority Queue

A queue is called a Priority Queue when it has the following characteristics:

• Each item in the queue must have a priority associated with it.
• Higher or lower priority elements must be dequeued before lower or higher priority elements respectively depending on priority order taken by user that is if user consider lower number as higher priority or higher number as higher priority.
• If two elements in the queue have the same priority value then the first in first out rule is followed for these two elements alone i.e. the element that entered the priority queue first will be the first to be removed.

Thank You