File tree Expand file tree Collapse file tree
Data Structure/Queue/Basic Queue Expand file tree Collapse file tree Original file line number Diff line number Diff line change 1+ // Java program to demonstrate a Queue using Linked List
2+
3+ class LinkedListQueue
4+ {
5+ private Node front , rear ;
6+ private int queueSize ; // queue size
7+
8+
9+ private class Node {
10+ int data ;
11+ Node next ;
12+ }
13+
14+ public LinkedListQueue ()
15+ {
16+ front = null ;
17+ rear = null ;
18+ queueSize = 0 ;
19+ }
20+
21+ public boolean isEmpty ()
22+ {
23+ return (queueSize == 0 );
24+ }
25+
26+ public int dequeue ()
27+ {
28+ int data = front .data ;
29+ front = front .next ;
30+ if (isEmpty ())
31+ {
32+ rear = null ;
33+ }
34+ queueSize --;
35+ System .out .println ("Element " + data + " removed from the queue" );
36+ return data ;
37+ }
38+
39+ public void enqueue (int data )
40+ {
41+ Node oldRear = rear ;
42+ rear = new Node ();
43+ rear .data = data ;
44+ rear .next = null ;
45+ if (isEmpty ())
46+ {
47+ front = rear ;
48+ }
49+ else {
50+ oldRear .next = rear ;
51+ }
52+ queueSize ++;
53+ System .out .println ("Element " + data + " added to the queue" );
54+ }
55+
56+ public void print_frontRear () {
57+ System .out .println ("Front of the queue:" + front .data
58+ + " Rear of the queue:" + rear .data );
59+ }
60+ }
61+ class QueueLLImplementation {
62+ public static void main (String a []){
63+ LinkedListQueue queue = new LinkedListQueue ();
64+ queue .enqueue (16 );
65+ queue .enqueue (30 );
66+ queue .print_frontRear ();
67+ queue .enqueue (11 );
68+ queue .enqueue (2 );
69+ queue .dequeue ();
70+ queue .dequeue ();
71+ queue .enqueue (9 );
72+ queue .print_frontRear ();
73+ }
74+ }
You can’t perform that action at this time.
0 commit comments