blob: 1d30f0d7bcc4b601fc807783185c74c63df00b8f (
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
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
|
#ifndef SINGLY_LINKED_LIST_HPP
#define SINGLY_LINKED_LIST_HPP
#include <iostream>
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 (TravelNode = list->_head; TravelNode->_next!= nullptr;)
{
TravelNode = TravelNode->_next;
}
TravelNode->_next = node;
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;
return true;
}
template<typename T>
inline bool RemoveFirst(SinglyLinkedList<T>* list, ListNode<T>* node)
{
if (list->_size == 0)
{
std::cout << "Empty list... there is nothing to delete!" << std::endl;
return true;
}
ListNode<T>* Temp = list->_head;
list->_head = node->_next;
list->_size--;
delete Temp;
return true;
}
template<typename T>
inline bool RemoveLast(SinglyLinkedList<T>* list, ListNode<T>* node)
{
if (list->_size == 0)
{
std::cout << "Empty list... there is nothing to delete!" << std::endl;
return true;
}
if (list->size == 1)
{
delete list->_head;
list->_head = nullptr;
list->_size--;
return true;
}
ListNode<T>* TraverseNode = list->_head;
while (TraverseNode->_next->_next != nullptr)
{
TraverseNode = TraverseNode->_next;
}
delete TraverseNode->_next;
TraverseNode->_next = nullptr;
list->_size--;
return true;
}
#endif
|