If you want to practice data structure and algorithm programs, you can go through 100+ java coding interview questions.
In this post , we will see how to implement Queue using Linked List in java.
Queue is abstract data type which demonstrates First in first out (FIFO) behaviour. We will implement same behaviour using Array.
Although java provides implementation for  all abstract data types such as Stack , Queue and LinkedList but it is always good idea to understand basic data structures and implement them yourself.
Please note that LinkedList implementation of Queue is dynamic in nature.
There are two most important operations of Queue:
enqueue :Â It is operation when we insert element into the queue.
dequeue :Â It is operation when we remove element from the queue. Read more at
Java Program to implement Queue using Linked List:
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 |
package org.arpit.java2blog; public class QueueUsingLinkedListMain { private Node front, rear; private int currentSize; // number of items //class to define linked node private class Node { int data; Node next; } //Zero argument constructor public QueueUsingLinkedListMain() { front = null; rear = null; currentSize = 0; } public boolean isEmpty() { return (currentSize == 0); } //Remove item from the beginning of the list. public int dequeue() { int data = front.data; front = front.next; if (isEmpty()) { rear = null; } currentSize--; System.out.println(data+ " removed from the queue"); return data; } //Add data to the end of the list. public void enqueue(int data) { Node oldRear = rear; rear = new Node(); rear.data = data; rear.next = null; if (isEmpty()) { front = rear; } else { oldRear.next = rear; } currentSize++; System.out.println(data+ " added to the queue"); } public static void main(String a[]){ QueueUsingLinkedListMain queue = new QueueUsingLinkedListMain(); queue.enqueue(6); queue.dequeue(); queue.enqueue(3); queue.enqueue(99); queue.enqueue(56); queue.dequeue(); queue.enqueue(43); queue.dequeue(); queue.enqueue(89); queue.enqueue(77); queue.dequeue(); queue.enqueue(32); queue.enqueue(232); } } |
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 |
6 added to the queue 6 removed from the queue 3 added to the queue 99 added to the queue 56 added to the queue 3 removed from the queue 43 added to the queue 99 removed from the queue 89 added to the queue 77 added to the queue 56 removed from the queue 32 added to the queue 232 added to the queue |
