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.
Program/Source Code:
The source code to create a Queue using LinkedList is given below. The given program is compiled and executed successfully.
// Java program to create a Queue
// using LinkedList
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: \n" + queue);
}
}
Output:
Queue elements:
[10, 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, and printed them.
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.
Program/Source Code:
The source code to create a Queue using LinkedList is given below. The given program is compiled and executed successfully.
Output:
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, and printed them.