-
Notifications
You must be signed in to change notification settings - Fork 3
Expand file tree
/
Copy pathqueue_using-sll.cpp
More file actions
187 lines (135 loc) · 2.57 KB
/
queue_using-sll.cpp
File metadata and controls
187 lines (135 loc) · 2.57 KB
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
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
#include<iostream>
using namespace std;
struct node{
int data;
node *next;
};
class queue
{
private:
struct node *front;
public:
queue() //constructor
{
front=NULL;
}
void push();
void pop();
void show();
void peek();
void isEmpty();
};
void queue::push()
{
int value;
struct node *ptr, *traverse;
traverse=front;
ptr = new node;
cout<<"\nEnter the value to be inserted :";
cin>>value;
if(front==NULL)
{
ptr->data=value;
ptr->next=front;
front=ptr;
}
else
{
while(traverse->next!=NULL)
traverse=traverse->next;
ptr->data=value;
ptr->next=NULL;
traverse->next=ptr;
}
}
void queue::pop()
{
struct node *temp;
if(front==NULL)
{
cout<<"The list is Empty..";
return;
}
temp=front;
front=temp->next;
cout<<"\nThe item popped out is "<<temp->data;
delete temp;
}
void queue::show()
{
struct node *temp1=front;
if(front==NULL)
{
cout<<"The list is Empty..";
return;
}
while(temp1!=NULL)
{
if(temp1->next!=NULL)
{
cout<<temp1->data<<" -> ";
temp1=temp1->next;
}
else
{
cout<<temp1->data;
temp1=temp1->next;
}
}
}
void queue::peek()
{
if(front==NULL)
{
cout<<"\nThe list is empty..";
return;
}
cout<<"\nThe element at the front of the queue is "<<front->data;
}
void queue::isEmpty()
{
if(front==NULL)
{
cout<<"\nThe queue is empty..";
return;
}
cout<<"\nThe queue is not empty";
}
int main()
{
queue s;
int choice;
while(1)
{
cout<<"\n-----------------------------------------------------------";
cout<<"\n\t\tQUEUE USING LINKED LIST\n\n";
cout<<"1:PUSH\n2:POP\n3:DISPLAY QUEUE\n4:PEEK\n5.IS THE QUEUE EMPTY?\n6:EXIT";
cout<<"\nEnter your choice(1-4): ";
cin>>choice;
switch(choice)
{
case 1:
s.push();
break;
case 2:
s.pop();
break;
case 3:
s.show();
break;
case 4:
s.peek();
break;
case 5:
s.isEmpty();
break;
case 6:
return 0;
break;
default:
cout<<"\nPlease enter correct choice(1-6)!!";
break;
}
}
return 0;
}