cpp/queue-operations.cpp at main · kushadige/cpp · GitHub

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
#include<iostream>
using std::cout;
classNode {
public:
int _info;
 Node *_rear = nullptr;
 Node *_front = nullptr;

//Constructor and Destructor for memory leak control
Node(){
 cout << "node constructor\n";
 }
~Node(){
 cout << "node destructor\n";
 }
};

classQueue {
 Node *_head = nullptr;
 Node *_back = nullptr;
public:
Queue(){
 cout << "queue constructor\n";
 }
~Queue(){
 cout << "queue destructor\n";
 }

voidinsert(int x){

if(_head == nullptr && _back == nullptr){
 Node *p = newNode();

 p->_info = x;

 _head = p;
 _back = p;

return;
 }

 Node *newNode = newNode();

 newNode->_info = x;

 _back->_rear = newNode;
 newNode->_front = _back;

 _back = newNode;

 }
voidremove(){
if(_head == nullptr){
 cout << "void remove\n";
return;
 }
 Node *temp = _head->_rear;
delete _head;
 _head = temp;
 }
voidprint(){
if(_head == nullptr){
 cout << "queue is empty\n";
return;
 }
 Node *temp = _back;
while(temp != _head){
 cout << temp->_info << "-";
 temp = temp->_front;
 }
 cout << _head->_info << "\n";
 }
friendboolis_empty(Queue &q);
};
boolis_empty(Queue &q){
if(q._head != nullptr){
returnfalse;
 }
returntrue;
}

intmain(){
 {
 Queue queue;
 queue.insert(10);
 queue.insert(20);
 queue.insert(30);
 queue.insert(40);
 queue.print();
 queue.remove();
 queue.print();
 queue.insert(50);
 queue.print();

while(!is_empty(queue)){
 queue.remove();
 }
//control
 queue.remove();
 queue.print();
 }
}