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
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
|
#ifndef SINGLY_LINKED_LIST_HPP
#define SINGLY_LINKED_LIST_HPP
#include <iostream>
#include "Node.hpp"
template<typename T>
struct ListNode
{
T _data{0};
ListNode* _next {nullptr};
};
template<typename T>
struct SinglyLinkedList
{
size_t _size {0};
ListNode<T>* _head{ nullptr };
};
template<typename T>
inline bool Append(SinglyLinkedList<T>* list, ListNode<T>* node)
{
if (list->_size == 0)
{
list->_head = node;
list->_size++;
return true;
}
ListNode<T>* TraverseNode = nullptr;
for (TraverseNode = list->_head; TraverseNode->_next != nullptr;)
{
TraverseNode = TraverseNode->_next;
}
TraverseNode->_next = node;
list->_size++;
return true;
}
template<typename T>
inline bool Prepend(SinglyLinkedList<T>* list, ListNode<T>* node)
{
if (list->_size == 0)
{
list->_head = node;
list->_size++;
return true;
}
node->_next = list->_head;
list->_head = node;
list->_size++;
return true;
}
template<typename T>
inline bool RemoveFirst(SinglyLinkedList<T>* list)
{
if (list->_size == 0)
{
std::cout << "Empty list... there is nothing to delete!" << std::endl;
return true;
}
if (list->_size == 1)
{
list->_head =nullptr;
list->_size--;
}
else
{
ListNode<T>* Temp = list->_head;
list->_head = list->_head->_next;
Temp->_next = nullptr;
list->_size--;
}
return true;
}
template<typename T>
inline bool RemoveLast(SinglyLinkedList<T>* list)
{
if (list->_size == 0)
{
std::cout << "Empty list... there is nothing to delete!" << std::endl;
return true;
}
if (list->_size == 1)
{
list->_head = nullptr;
list->_size--;
return true;
}
ListNode<T>* TraverseNode = list->_head;
while (TraverseNode->_next->_next != nullptr)
{
TraverseNode = TraverseNode->_next;
}
TraverseNode->_next = nullptr;
list->_size--;
return true;
}
template <typename T>
inline bool InsertAfter(SinglyLinkedList<T>* List, const int Data, ListNode<T>* node)
{
if (List->_head == nullptr)
{
Append(List, node);
return true;
}
ListNode<T>* Traverse = List->_head;
for (auto i = 1; i < Data && Traverse != nullptr; i++)
{
Traverse = Traverse->_next;
}
node->_next = Traverse->_next;
Traverse->_next = node;
List->_size++;
return true;
}
template <typename T>
inline bool InsertBefore(SinglyLinkedList<T>* List, const int Data, ListNode<T>* node)
{
if (List->_head == nullptr)
{
Append(List, node);
return true;
}
ListNode<T>* Traverse = List->_head;
ListNode<T>* Follower = nullptr;
for (auto i = 1; i < Data && Traverse != nullptr; i++)
{
Follower = Traverse;
Traverse = Traverse->_next;
}
node->_next = Follower->_next;
Follower->_next = node;
List->_size++;
return true;
}
template <typename T>
inline bool Clear(SinglyLinkedList<T>* List)
{
if (List->_size == 0)
{
return true;
}
if (List->_size == 1)
{
List->_head = nullptr;
List->_size--;
return true;
}
ListNode<T>* Traverse = List->_head;
ListNode<T>* TempNode = Traverse;
do
{
TempNode = Traverse;
Traverse = Traverse->_next;
TempNode->_data = 0;
TempNode->_next = nullptr;
} while (Traverse->_next != nullptr);
List->_size = 0;
List->_head = nullptr;
return true;
}
template <typename T>
inline bool Empty(SinglyLinkedList<T>* List)
{
return (List->_size == 0 && List->_head == nullptr);
}
template <typename T>
inline bool Remove(SinglyLinkedList<T>* List, ListNode<T>* node)
{
ListNode<T>* Traverse = List->_head;
ListNode<T>* Previous = nullptr;
while (Traverse != node)
{
Previous = Traverse;
Traverse = Traverse->_next;
}
if (Traverse == List->_head)
{
return RemoveFirst(List);
}
if (Traverse->_next == nullptr)
{
return RemoveLast(List);
}
Previous->_next = Traverse->_next;
Traverse->_next = nullptr;
Traverse->_data = 0;
List->_size--;
return true;
}
template <typename T>
inline ListNode<T>* Extract(SinglyLinkedList<T>* List, const int Data)
{
ListNode<T>* Temp = new ListNode<T>{ 0, nullptr };
ListNode<T>* Travel = nullptr;
if (Empty(List))
{
std::cout << "Empty list, nothing to extract!" << std::endl;
return Temp;
}
for (Travel = List->_head; Travel->_data != Data && Travel->_next != nullptr;)
{
Travel = Travel->_next;
}
Temp->_data = Travel->_data;
if (Remove<T>(List, Travel))
{
return Temp;
}
return nullptr;
}
#endif
|