-
Notifications
You must be signed in to change notification settings - Fork 0
/
qeueu.h
executable file
·154 lines (139 loc) · 2.16 KB
/
qeueu.h
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
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
#pragma once
#include<iostream>
using namespace std;
#include "node.h"
template <class T>
class qeueu
{
node<T>* head, *tail;
int count;
public:
qeueu(void);
int getcount() ;
void enqueue(T val);
void clear();
bool dequeue();
T front();
T back();
bool empty();
node<T>* gethead();
~qeueu(void);
};
template <class T>
qeueu<T>::qeueu(void)
{
head=NULL;
tail=NULL;
count=0;
}
template <class T>
qeueu<T>::~qeueu(void)
{
while(!empty())
clear();
}
template <class T>
int qeueu<T>::getcount()
{
return count;
}
template <class T>
void qeueu<T>::enqueue(T val)
{
node<T>* inserted =new node<T> (val);
if(!tail)
{
tail=head=inserted;
}
else if(inserted ->getvalue() > front())
{
inserted->setnext(head);
head=inserted;
}
else if(inserted ->getvalue() < back())
{
tail->setnext(inserted);
tail=inserted;
}
else
{
node<T>* ptr=head->getnext();
node<T>* prev=head;
while(ptr > inserted)
{
ptr=ptr->getnext();
prev=prev->getnext();
}
inserted->setnext(ptr);
prev->setnext(inserted);
}
count++;
}
/*template <class T>
void qeueu<T>::enqueue(T val) // add element at the end of the list
{
if(!tail)
{
node<T>* inserted =new node<T> (val);
tail=head=inserted;
count++;
}
else
{
node<T>* inserted =new node<T> (val);
tail->setnext(inserted);
tail= inserted;
tail->setnext(NULL);
count++;
}
}
*/
template <class T>
void qeueu<T>::clear()
{
while(head)
dequeue();
head=tail=NULL;
}
template <class T>
bool qeueu<T>::dequeue()
{
if (empty())
return false;
if(count==1)
{
node<T>* del=head;
head=tail=NULL;
delete del; //// et3dlt
count--;
return true;
}
else
{
node<T>* del=head;
head=head->getnext();
delete del;
count--;
return true;
}
}
template <class T>
T qeueu<T>::front()
{
return head->getvalue();
}
template <class T>
T qeueu<T>::back()
{
return tail->getvalue();
}
template <class T>
bool qeueu<T>::empty()
{
return (getcount()==0);
}
template <class T>
node<T>* qeueu<T>::gethead(){
node<T>* temp=head;
return temp;
}