DataStructures/Queue.cpp at main · sukerberk1/DataStructures · 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
#include "Queue.h"
#include "Node.cpp"
#include <iostream>

template <typename T>
Queue<T>::Queue() : head(nullptr), tail(nullptr), size(0) { }

template <typename T>
void Queue<T>::Enqueue(T value)
{
	LinkedListNode<T>* n = new LinkedListNode<T>(value);
	this->Enqueue(n);
}

template <typename T>
void Queue<T>::Enqueue(LinkedListNode<T>* node)
{
	if (head == nullptr)
	{
		head = node;
		tail = node;
		return;
	}
	tail->next = node;
	tail = node;
	size++;
}

template <typename T>
T Queue<T>::Pop()
{
	return PopNode().value;
}

template <typename T>
LinkedListNode<T> Queue<T>::PopNode()
{
	LinkedListNode<T>* n = head;
	head = head->next;
	size--;
	n->next = nullptr;
	return *n;
}

template <typename T>
void Queue<T>::Display()
{
	auto n = head;
	for (int i = 0; i <= this->size; i++)
	{
		std::cout << i + 1 << " " << n->value << std::endl;
		n = n->next;
	}
}