-
Notifications
You must be signed in to change notification settings - Fork 1
/
LinkedLists.c
68 lines (60 loc) · 1.39 KB
/
LinkedLists.c
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
#include <stdio.h>
#include <stdlib.h>
typedef struct Node{
int value;
struct Node* next;
}Node;
Node* initialise (int number) {
Node* node = (Node*)malloc(sizeof(Node));
node->value = number;
node->next = NULL;
return node;
}
void print_linked_list (Node* current) {
if (current->next == NULL) {
printf("%d\n", current->value);
return;
}
printf("%d\n", current->value);
print_linked_list(current->next);
}
void append (Node* LL, int number) {
Node* current = LL;
while (current->next != NULL) {
current = current->next;
}
current->next = (Node*)malloc(sizeof(Node));
current->next->value = number;
current->next->next = NULL;
}
void removeByValue (Node** LL, int value) {
Node* current = *LL;
if (current->value == value) {
Node* temp = *LL;
*LL = (*LL)->next;
free(temp);
return;
}
while (current->next->value != value) {
current = current->next;
}
Node* temp = current->next;
current->next = temp->next;
free(temp);
}
void pop (Node* LL) {
Node* current = LL;
if (current->next == NULL) {
free(current);
current->next = NULL;
return;
}
while (current->next->next != NULL) {
current = current->next;
}
free(current->next);
current->next = NULL;
}
int main () {
Node* ll = initialise(12);
}