If two elements present in the priority queue are having the same priority, then they will be served according to the order in which they are present in the queue.<\/li>\n<\/ul>\nThe priority queue is widely used in many applications like job scheduling algorithms, CPU and Disk scheduling, and managing various resources shared between different processes, etc.<\/p>\n
How is the Priority Value assigned in the Priority Queue?<\/h3>\n
Usually, an element’s value is considered for assigning the priority. For example, the element with bigger value will have a higher priority than the element with lower value.
\nWe can also set priorities according to our demand.<\/p>\n
![\"\"](\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1657607570156-Image-01.png\")
<\/p>\n
Functions used for implementing priority queue:-<\/h3>\n\n- push(new_element)<\/strong>: This function is used to insert a new element into the queue.<\/li>\n
- pop()<\/strong>: This function deletes the element with the lowest priority value from the queue.<\/li>\n
- peek()\/top()<\/strong>: This function is used to get the lowest priority element in the queue without deleting it from the queue.<\/li>\n<\/ul>\n
Approach:<\/h3>\n\n- Create a doubly linked list having fields data (hold the information of the Node), priority (hold the priority of the Node), prev (point to previous Node), next (point to next Node).<\/li>\n
- Insert both element and priority in the Node.<\/li>\n
- Arrange the Nodes in the increasing order of priority.<\/li>\n<\/ol>\n\t\t\t\t\t\t
![\"\"](\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1657607550969-Article.jpg\")
<\/p>\n