Prerequisite : Priority Queue, Comparator
Priority Queue is like a regular queue, but 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. For this, it uses a comparison function which imposes a total ordering of the elements.
The elements of the priority queue are ordered according to their natural ordering, or by a Comparator provided at queue construction time, depending on which constructor is used
- public PriorityQueue() : This creates a PriorityQueue with the default initial capacity (11) that orders its elements according to their natural ordering.
- public PriorityQueue(Collection c) : This creates a PriorityQueue containing the elements in the specified collection(c). If the specified collection is an instance of a SortedSet, this priority queue will be ordered according to the same ordering, else this priority queue will be ordered according to the natural ordering of its elements.
- public PriorityQueue(int capacity, Comparator comparator) : This creates a PriorityQueue with the specified initial capacity that orders its elements according to the specified comparator.
Parameters: capacity - the initial capacity for this priority queue comparator - the comparator that will be used to order this priority queue. If null, the natural ordering of the elements will be used.
- public PriorityQueue(SortedSet ss) : Creates a PriorityQueue containing the elements in the specified sorted set. This priority queue will be ordered according to the same ordering as the given sorted set.
Sample code provided illustrates students with high priority(based on cgpa) are served before the students having low cgpa.
Students served in their priority order Palak Anmol Nandini
Note : This type of Priority queue is preferred in scenarios where customized ordering is required, i.e when one wants a different sorting order, then one can define its own way of comparing instances. Comparator can be implemented if there is a more complex comparing algorithm, e.g. multiple fields and so on.
Don’t stop now and take your learning to the next level. Learn all the important concepts of Data Structures and Algorithms with the help of the most trusted course: DSA Self Paced. Become industry ready at a student-friendly price.
- PriorityQueue comparator() Method in Java
- PriorityQueue in Java
- PriorityQueue contains() Method in Java
- PriorityQueue add() Method in Java
- Java.util.PriorityQueue class in Java
- PriorityQueue remove() Method in Java
- PriorityQueue poll() Method in Java
- PriorityQueue size() Method in Java
- PriorityQueue offer() Method in Java
- PriorityQueue iterator() Method in Java
- PriorityQueue peek() Method in Java
- PriorityQueue clear() Method in Java
- PriorityQueue spliterator() method in Java
- PriorityQueue toArray() Method in Java
- Dijkstra's shortest path algorithm in Java using PriorityQueue
- Implement Stack using Queues
- Implement Stack and Queue using Deque
- Implement a stack using single queue
- How to implement stack using priority queue or heap?
- How to efficiently implement k Queues in a single array?
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
Improved By : AviralDubey