-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy patha_Queue_linklist.cpp
More file actions
122 lines (104 loc) · 2.15 KB
/
a_Queue_linklist.cpp
File metadata and controls
122 lines (104 loc) · 2.15 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
#include<iostream>
#include<conio.h>
#include<stdio.h>
using namespace std;
class Queue{
private:
struct node{
int item;
node *next;
};
node *front,*rear;
public:
Queue(){
front=NULL;
rear=NULL;
}
void insertion(int data){
node *t=new node;
t->item=data;
if(front==NULL){ // list/queue is empty
front=t;
t->next=NULL;
rear=t;
}
else{
t->next=NULL;
rear->next=t;
rear=t;
}
}
void deletion(){
if(front==NULL){
cout<<"\n Empty Queue / Underflow !";
}
else{
node *t=front;
front=front->next;
delete t;
}
}
int ViewFront(){
if(front==NULL){
cout<<"\n Underflow ! ";
}
else{
return front->item;
}
}
int ViewRear(){
if(front==NULL){
cout<<"\n Underflow ! ";
}
else{
return rear->item;
}
}
~Queue(){
while(front!=NULL){
deletion();
}
}
};
int driver(){
int choice;
cout<<"\n OPERATIONS : ";
cout<<"\n 1.Insertion ";
cout<<"\n 2. Deletion";
cout<<"\n 3. To view Front Element in Queue";
cout<<"\n 4. To view Last Element in Queue";
cout<<"\n Press 0 for exit ";
cout<<"\n Please Enter your choice : ";
cin>>choice;
return choice;
}
int main(){
int data;
Queue obj;
while(1){
switch (driver())
{
case 1:
cout<<"\n Enter data : ";
cin>>data;
obj.insertion(data);
break;
case 2:
obj.deletion();
break;
case 3:
cout<<obj.ViewFront();
break;
case 4:
cout<<obj.ViewRear();
break;
case 0:
exit(0);
break;
default:
cout<<"Please enter valid choice ,thank you !";
break;
}
}
return 0;
}