-
Notifications
You must be signed in to change notification settings - Fork 0
/
linked_list.cpp
128 lines (118 loc) · 2.23 KB
/
linked_list.cpp
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
#include <iostream>
#include <cstdlib>
using namespace std;
class LinkedList
{
private:
struct Node
{
int data;
Node *next;
};
Node *head;
Node *tail;
int size;
public:
LinkedList()
{
head = NULL;
tail = NULL;
size = 0;
}
void push_back(int data)
{
Node *newNode = (Node *)malloc(sizeof(Node));
newNode->data = data;
newNode->next = NULL;
if (head == NULL)
{
head = newNode;
tail = newNode;
}
else
{
tail->next = newNode;
tail = newNode;
}
size++;
}
void push_front(int data)
{
Node *newNode = (Node *)malloc(sizeof(Node));
newNode->data = data;
newNode->next = head;
head = newNode;
size++;
}
void pop_back()
{
if (head == NULL)
{
return;
}
Node *temp = head;
while (temp->next != tail)
{
temp = temp->next;
}
tail = temp;
free(temp);
size--;
}
void pop_front()
{
if (head == NULL)
{
return;
}
Node *temp = head;
head = head->next;
free(temp);
size--;
}
int front()
{
return head->data;
}
int back()
{
return tail->data;
}
int getSize()
{
return size;
}
bool empty()
{
return size == 0;
}
void print()
{
Node *temp = head;
while (temp != NULL)
{
std::cout << temp->data << " ";
temp = temp->next;
}
std::cout << std::endl;
}
};
int main()
{
LinkedList list = LinkedList();
list.push_back(2);
list.push_back(3);
list.push_front(1);
cout << "List debug: " << endl;
list.print();
cout << "Size: " << list.getSize() << endl;
cout << "Printing values starting from the front: " << endl;
cout << list.front() << endl;
list.pop_front();
cout << list.front() << endl;
list.pop_front();
cout << list.front() << endl;
list.pop_front();
cout << "Is list empty?" << endl;
cout << list.empty() << endl;
}