How to Create a LinkedHashSet with Custom Equality for Objects?

How to Remove the Top Element From a PriorityQueue in Java?

Last Updated : 15 Feb, 2024

A priority queue is a specialized type of queue, in which elements are given with priorities, and those with more priorities are served before elements with lower priorities. It's equivalent to a regular queue (first-in, first-out) but prioritizes urgency rather than arrival order.

Remove the Top Element from a PriorityQueue

In Java, we can remove the top element (element with the highest priority) from a PriorityQueue using the poll() method. This method removes and returns the highest priority element from the queue.

Syntax:

public E poll()

Program to Remove the Top Element(highest priority) From a PriorityQueue

Here is the implementation:

Java

// Java Program to Remove the Top
// Element From a PriorityQueue
import java.io.*;
import java.util.PriorityQueue;

// Driver Class
public class Main {
    public static void main(String[] args)
    {
        // Creating a PriorityQueue
        PriorityQueue<Integer> pq = new PriorityQueue<>();

        // Adding elements to the PriorityQueue
        pq.add(5);
        pq.add(10);
        pq.add(1);
        pq.add(20);

        System.out.println("PriorityQueue before removal: " + pq);

        // Removing the top element (highest priority) using
        // poll()
        int top = pq.poll();
        System.out.println("Removed element: " + top);

        // Printing the PriorityQueue after removal
        System.out.println("PriorityQueue after removal: " + pq);
    }
}

Output

PriorityQueue before removal: [1, 10, 5, 20]
Removed element: 1
PriorityQueue after removal: [5, 10, 20]

Explaination of the above Program:

Create a PriorityQueue
Add Elements to the PriorityQueue
Remove the Top Element (Highest Priority)
Print the Removed Element
Print PriorityQueue after Removal

How to Create a LinkedHashSet with Custom Equality for Objects?

M

mrstax

Improve

Article Tags :

Practice Tags :

Java

Similar Reads

How to Copy Elements from One PriorityQueue to Another in Java?

In Java, a priority queue is a data structure that allows the users to store data based on their priority. In this article, we will learn how to copy elements from one priority queue to another in Java. Example Input: PriorityQueue original ={1,2,3,4,5}Output: PriorityQueue Copy ={1,2,3,4,5}Copy ele

How to Iterate over the Elements of a PriorityQueue in Java?

In Java, a Priority Queue is a Data structure that allows the users to store data based on their priority so that the elements with the highest priority can be accessed in constant time. In this article, we will learn how to iterate over the elements of a PriorityQueue in Java. Example Input: Priori

How to Handle Null Elements in a PriorityQueue in Java?

In Java, a Priority Queue is an abstract data type similar to a regular queue or stack, but with a key difference like elements are dequeued based on their priority. Regarding the null value property, the PriorityQueue class does not allow null elements. Attempting to add a null element will result

Java Program to Implement PriorityQueue API

A PriorityQueue is a linear data structure in which the elements are ordered according to their natural ordering or by some custom comparator provided at the queue at construction time. In PriorityQueue, the front of the queue points to the least element, and the rear points to the greatest element

How to Configure Java Priority Queue to Handle Duplicate Elements?

In Java, PriorityQueue is the data structure that stores the elements based on their priorities and provides operations to efficiently retrieve and manipulate these elements based on their priorities. PriorityQueue handles the duplicate elements using a comparator. Comparator is a pre-defined interf

How to Check if a PriorityQueue is Empty or Contains Elements in Java?

In this article, we will demonstrate how to check if a Priority Queue is empty or not. The java.util.PriorityQueue.isEmpty() method is used to check if the Priority Queue is empty or not. Based on the Boolean value it returns the Response for the same. Syntax: Priority_Queue.isEmpty()Parameters: The

How to Find the Intersection and Union of Two PriorityQueues in Java?

In Java, PriorityQueue is an implementation of the Queue Interface. It can be used to provide a way to store the elements in a queue based on their priority basis. This means high-priority elements can store first compared to lower-priority elements in the queue. In this article, we will be learning

How to Create a Thread-Safe Queue in Java?

In Java, thread-safe is defined as the Queue data structure and it allows multiple threads to safely add and remove elements from the queue concurrently without any data corruption. In a multithreaded environment, the threads access and modify the shared data concurrently, and it is important to ens

How to Convert a PriorityQueue into an Array, List, and Set in Java?

In Java, PriorityQueue is an implementation of the Queue interface. It means high-priority elements can be saved first compared to lower-priority elements in the queue, and it follows the natural order of elements. In this article, we will learn how to convert a PriorityQueue into an Array, List, an

How to Perform Range Queries on a PriorityQueue in Java?

Based on a priority heap, a Java PriorityQueue represents an unlimited priority queue. PriorityQueue does not directly handle range queries, but it does provide quick access to the element with the greatest priority. On the other hand, range queries may be executed by taking pieces from the Priority