-
Notifications
You must be signed in to change notification settings - Fork 0
/
queue.cpp
82 lines (82 loc) · 1.76 KB
/
queue.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
#include<iostream>
using namespace std;
class Queue{
public:
int value;
class Queue* next;
Queue* newQueue1;
Queue(int);
void Insert(int);
void Pop(class Queue**);
void display();
bool is_Empty();
~Queue();
};
Queue::~Queue(){
delete newQueue1;
}
Queue::Queue(int root){
this->value = root;
this->next = NULL;
}
void Queue::Insert(int val){
Queue* This = this;
newQueue1 = new Queue(val);
while(This){
if(!This->next){
This->next = newQueue1;
return;
}
This = This->next;
}
delete newQueue1;
}
void Queue::Pop(Queue ** This){
Queue* Next = *This,
*NNext =Next->next;
*This = NNext;
NNext = NULL;
Next = NULL;
}
void Queue::display(){
Queue* This = this;
while(This){
cout<<This->value<<" ";
This = This->next;
}
cout<<endl;
}
bool Queue::is_Empty(){
if(this) return false;
else return true;
}
int main(){
Queue* newQueue = new Queue(1);
newQueue->Insert(2);
newQueue->Insert(3);
newQueue->Insert(4);
newQueue->Insert(5);
newQueue->Insert(6);
newQueue->display();
newQueue->Pop(&newQueue);
newQueue->display();
newQueue->Pop(&newQueue);
newQueue->display();
newQueue->Pop(&newQueue);
newQueue->display();
newQueue->Insert(2);
newQueue->Pop(&newQueue);
newQueue->display();
newQueue->Insert(3);
newQueue->Pop(&newQueue);
newQueue->Pop(&newQueue);
newQueue->Pop(&newQueue);
newQueue->Insert(17);
newQueue->display();
while(!newQueue->is_Empty()){
newQueue->Pop(&newQueue);
newQueue->display();
}
delete newQueue;
return 0;
}