forked from HarshCasper/NeoAlgo
-
Notifications
You must be signed in to change notification settings - Fork 0
/
QueueLinkedList.cpp
91 lines (80 loc) · 1.58 KB
/
QueueLinkedList.cpp
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
79
80
81
82
83
84
85
86
87
88
89
90
91
/*Implementation of Queue using linked list U can peerfom enqueue , dequeue and display elements of queue */
#include<iostream>
using namespace std;
class Node {
int data;
Node *next;
public:
friend class queue;
};
class queue {
Node *front , *rear;
public:
queue() {
front = rear = NULL;
}
void enQueue(int x) {
if (rear == NULL) {
Node *temp = new Node();
temp->data = x;
temp->next = NULL;
rear = temp;
front = rear;
}
else {
Node *temp = new Node();
temp->data = x;
temp->next = NULL;
rear->next = temp;
rear = temp;
}
}
void deQueue() {
// Node *temp = front;
if (front == NULL)
{
return;
}
Node * temp = front;
front = front->next;
if (front == NULL) {
rear = NULL;
}
cout << "Deleted Elemeted is :" << temp->data << endl;
free(temp);
}
void displayQueue() {
Node *temp = front;
if ((front == NULL) || (rear == NULL)) {
cout << "Queue is empty!!" << endl;
return;
}
cout << "Queue Elements are :" << endl;
while (temp != NULL) {
cout << temp->data << " ";
temp = temp->next;
}
cout << endl;
}
};
int main() {
queue q;
int ch;
do {
cout << "Enter the option below :\n1.Enqueue an Element \n2.Dequeue an Element \n3.Display all elements of a queue\n4.Exit \n";
cin >> ch;
switch (ch) {
case 1:
int k;
cin >> k;
q.enQueue(k);
break;
case 2:
q.deQueue();
break;
case 3:
q.displayQueue();
break;
}
} while (ch != 4);
}