Java Queue in Depth

Article by: Manish Methani

Last Updated: October 23, 2021 at 2:04pm IST
47 sec read

What is Queue?

A java queue or FIFO (first in, first out) is an abstract data type that serves as a collection of elements, with two principal operations: enqueue, the process of adding an element to the collection.(The element is added from the rear side) and dequeue the process of removing the first element that was added. (The element is removed from the front side). It can be implemented by using both an array and linked list.

Example:-

import java.util.*;

public class JavaStackDemo {
  public static void main(String[] args)
  {
  //Create an empty Stack
  Stack stack = new Stack();
  
  System.out.println("After Push Operation on Stack :");
  stack.push("first");
  printStackElements(stack);
  stack.push("second");
  printStackElements(stack);
  stack.push("third");
  printStackElements(stack);
  
  System.out.println("
After Pop Operation on Stack :");
  stack.pop();
  printStackElements(stack);
  stack.pop();
  printStackElements(stack);
  stack.pop();
  printStackElements(stack);
  
  
  }
  
  private static void printStackElements(Stack stack)
  {
    if(stack.isEmpty())
    {
      System.out.println("No more items left on the stack");
    }
    else
    {
      System.out.printf("%s
", stack);
    }
  }
}

Output:-

[first, second, third] 
[second, third] 
second