Repository navigation
Expand file tree
/
Copy pathlinked_list.c
More file actions
147 lines (121 loc) · 2.81 KB
/
Copy pathlinked_list.c
File metadata and controls
147 lines (121 loc) · 2.81 KB
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
/**
* @file linked_list.c
* @brief Implementations of Singly Linked List operations.
*
* Part of the C Learning & DSA Toolkit.
*/
#include "linked_list.h"
#include <stdio.h>
#include <stdlib.h>
void list_init(LinkedList *list) {
if (list == NULL) {
return;
}
list->head = NULL;
list->count = 0;
}
bool list_insert_beginning(LinkedList *list, int value) {
if (list == NULL) {
return false;
}
Node *new_node = (Node *)malloc(sizeof(Node));
if (new_node == NULL) {
return false;
}
new_node->data = value;
new_node->next = list->head;
list->head = new_node;
list->count++;
return true;
}
bool list_insert_end(LinkedList *list, int value) {
if (list == NULL) {
return false;
}
Node *new_node = (Node *)malloc(sizeof(Node));
if (new_node == NULL) {
return false;
}
new_node->data = value;
new_node->next = NULL;
if (list->head == NULL) {
list->head = new_node;
} else {
Node *current = list->head;
while (current->next != NULL) {
current = current->next;
}
current->next = new_node;
}
list->count++;
return true;
}
bool list_delete_value(LinkedList *list, int value) {
if (list == NULL || list->head == NULL) {
return false;
}
Node *current = list->head;
Node *prev = NULL;
while (current != NULL && current->data != value) {
prev = current;
current = current->next;
}
if (current == NULL) {
return false;
}
if (prev == NULL) {
list->head = current->next;
} else {
prev->next = current->next;
}
free(current);
list->count--;
return true;
}
int list_search(const LinkedList *list, int value) {
if (list == NULL || list->head == NULL) {
return -1;
}
Node *current = list->head;
int index = 0;
while (current != NULL) {
if (current->data == value) {
return index;
}
current = current->next;
index++;
}
return -1;
}
int list_count(const LinkedList *list) {
if (list == NULL) {
return 0;
}
return list->count;
}
void list_display(const LinkedList *list) {
if (list == NULL || list->head == NULL) {
printf("List: [Empty]\n");
return;
}
printf("List: ");
Node *current = list->head;
while (current != NULL) {
printf("%d -> ", current->data);
current = current->next;
}
printf("NULL (total: %d nodes)\n", list->count);
}
void list_free(LinkedList *list) {
if (list == NULL) {
return;
}
Node *current = list->head;
while (current != NULL) {
Node *temp = current->next;
free(current);
current = temp;
}
list->head = NULL;
list->count = 0;
}