-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathQues-9.cpp
123 lines (107 loc) · 2.04 KB
/
Ques-9.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
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
/*
QUESTION-9:
Create and perform different operations on Double-ended Queues using Linked List implementation.
SOLUTION:
*/
#include <iostream>
using namespace std;
template <class T>
class node
{
public:
T info;
node *next;
node(T a,node *p=0)
{
info=a;
next=p;
}
~node()
{
delete next;
}
};
template <class T>
class queue
{
node <T> *f;
node <T> *r;
public:
queue()
{
f=r=0;
}
~queue()
{
delete f;
delete r;
}
void Enqueue(T ele);
T DeQueue();
void display();
};
template <class T> void queue<T>::Enqueue(T ele)
{
if(f==0 && r==0)
{
r=new node<T>(ele);
f=r;
}
else
{
r->next=new node<T>(ele);
r=r->next;
}
}
template <class T> T queue<T>::DeQueue()
{
if(f==0 && r==0)
{
cout<<"\nEmpty Stack\n";
return -99999;
}
else
{
node <T> *tmp=f;
f=f->next;
T d=tmp->info;
delete tmp;
return d;
}
}
template <class T> void queue<T>::display()
{
if(f==0 && r==0)
{
cout<<"\nEmpty Stack\n";
}
else
{
for(node<T> *p=f;p!=0;p=p->next)
cout<<p->info<<"\n";
}
}
int main()
{
cout << "\n\t ~~~~~~~~~~~~~~~~~~~~~~~Practical 9~~~~~~~~~~~~~~~~~~~~\n\t\t\t\t \n";
int ch,n;
queue <int> q;
do{
cout << "\nQueue Using Linked List\n\n 1.Enqueue\n 2.Dequeue\n 3.Display\n 4.Exit\nEnter Your Choice=";
cin>>ch;
switch(ch)
{
case 1: cout<<"\nEnter a Number to be Enqueued=";
cin>>n;
q.Enqueue(n);break;
case 2: n=q.DeQueue();
if(n!=-99999)
cout<<"\nElement Removed="<<n;break;
case 3: cout<<"\nElements in the Queue are:-\n";
q.display();break;
case 4: break;
default: cout<<"\nInvalid Input.\n";
}
}while(ch!=4);
return 0;
}