Home » Java » Java Programs

Java program to retrieve an element from the head of the queue

Java example to retrieve an element from the head of the queue.
Submitted by Nidhi, on April 27, 2022

Problem statement

In this program, we will create a queue using the Queue interface with the help of Linked List collection and store elements in a FIFO (First In First Out) manner. Then we will use the poll() method to retrieve & remove an element from the head of the queue.

Source Code

The source code to retrieve an element from the head of the queue is given below. The given program is compiled and executed successfully.

// Java program to retrieve an element from 
// head of the queue

import java.util.LinkedList;
import java.util.Queue;

public class Main {
  public static void main(String[] args) {
    Queue < Integer > queue = new LinkedList < > ();

    queue.add(10);
    queue.add(20);
    queue.add(30);
    queue.add(40);
    queue.add(50);

    System.out.println("Queue elements: ");
    for (int item: queue) {
      System.out.print(item + " ");
    }

    System.out.println("\n\nRemoved element: " + queue.poll());
    System.out.println("\nQueue elements: ");
    for (int item: queue) {
      System.out.print(item + " ");
    }
  }
}

Output

Queue elements: 
10 20 30 40 50 

Removed element: 10

Queue elements: 
20 30 40 50

Explanation

In the above program, we imported the "java.util.LinkedList" and "java.util.Queue" packages to use the Queue Interface and LinkedList collection respectively. Here, we created a class Main. The Main class contains a main() method. The main() method is the entry point for the program.

In the main() method, we created a queue using the LinkedList collection and added items to it. Then we used the poll() method to access and remove an element from the head of the queue and printed the result.

Java Queue Interface Programs »

---