In this program, we will create 3 queues using the Queue interface with the help of ArrayDequeue class and store elements in a FIFO (First In First Out) manner. Here, we will compare queues using the equals() method.
Program/Source Code:
The source code to implement Queue using ArrayDeque class is given below. The given program is compiled and executed successfully.
// Java program to implement Queue
// using ArrayDeque class
import java.util.*;
public class Main {
public static void main(String[] args) {
Queue < Integer > queue = new ArrayDeque < > ();
queue.add(10);
queue.add(20);
queue.add(30);
queue.add(40);
queue.add(50);
Iterator itr = queue.iterator();
System.out.println("Queue elements: ");
while (itr.hasNext()) {
System.out.print(itr.next() + " ");
}
}
}
Output:
Queue elements:
10 20 30 40 50
Explanation:
In the above program, we imported the "java.util.*" package to use the Queue Interface and LinkedList collection. 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 ArrayDeque class and added items to it. Then we printed items of the queue.
In this program, we will create 3 queues using the Queue interface with the help of ArrayDequeue class and store elements in a FIFO (First In First Out) manner. Here, we will compare queues using the equals() method.
Program/Source Code:
The source code to implement Queue using ArrayDeque class is given below. The given program is compiled and executed successfully.
Output:
Explanation:
In the above program, we imported the "java.util.*" package to use the Queue Interface and LinkedList collection. 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 ArrayDeque class and added items to it. Then we printed items of the queue.