-
Notifications
You must be signed in to change notification settings - Fork 0
/
FIFO.cpp
90 lines (71 loc) · 1.33 KB
/
FIFO.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
#include <iostream>
using namespace std;
template <class H> class Node{
private:
H key;
Node<H> *next;
public:
Node(H k, Node<H> *n=0) : key(k), next(n) {}
void setKey(H k){
key=k;
}
void setNext(Node<H> *n){
next=n;
}
H getKey() const{
return key;
}
Node<H>* getNext() const{
return next;
}
};
template <class H> class Queue{
private:
Node<H> *front, *rear;
public:
Queue(){
front=rear=0;
}
Queue<H>* enqueue(H x){
if(!front){
front=new Node<H>(x, front);
rear=front;
return this;
}
Node<H>* aux=new Node<H>(x);
rear->setNext(aux);
rear=aux;
return this;
}
Queue<H>* dequeue(){
if(!front){
cout<<"Queue is Empty"<<endl;
return this;
}
Node<H>* aux=front;
front=front->getNext();
delete aux;
return this;
}
void print(){
Node<H>* aux=front;
while(aux){
cout<<aux->getKey()<<" ";
aux=aux->getNext();
}
cout<<endl;
}
void clear(){
front=0;
rear=0;
}
};
int main(){
Queue<int>* q=new Queue<int>();
q->print();
q->dequeue();
q->enqueue(10)->enqueue(1)->enqueue(5)->enqueue(8)->enqueue(4)->print();
q->dequeue()->dequeue()->dequeue()->dequeue()->dequeue()->enqueue(11)->print();
q->clear();
q->print();
}