blob: 02c8888e22d4f806af973b495f96970972ca87bd (
plain) (
blame)
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
|
#ifndef QUEUE_DYNAMIC
#define QUEUE_DYNAMIC
template <class T>
class Queue {
struct Node {
T val;
Node* next;
Node(const T& v) : val(v), next(nullptr) {}
};
Node* head;
Node* tail;
public:
Queue();
~Queue();
Queue(Queue& other) = delete;
Queue& operator=(Queue& other) = delete;
void push(const T& v);
void pop();
T& front();
};
template <class T>
Queue<T>::Queue() : head(nullptr), tail(nullptr) {}
template <class T>
Queue<T>::~Queue() {
while (head != nullptr)
pop();
}
template <class T>
void Queue<T>::push(const T& v) {
if (head == nullptr) {
head = tail = new Node(v);
}
else {
tail->next = new Node(v);
tail = tail->next;
}
}
template <class T>
void Queue<T>::pop() {
Node* toDel = head;
head = head->next;
delete toDel;
if (head == nullptr) tail = nullptr;
}
template <class T>
T& Queue<T>::front() {
return head->val;
}
#endif
|
