Singly linked list in C: solved exercise with insert and delete

 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

#include <stdio.h>
#include <stdlib.h>

typedef struct Node {
    int value;
    struct Node *next;
} Node;

Node *insert_head(Node *head, int value) {
    Node *n = malloc(sizeof(Node));
    if (!n) return head;
    n->value = value;
    n->next = head;
    return n;
}

Node *delete_value(Node *head, int value) {
    Node *cur = head, *prev = NULL;
    while (cur && cur->value != value) {
        prev = cur;
        cur = cur->next;
    }
    if (!cur) return head;
    if (!prev) head = cur->next;
    else prev->next = cur->next;
    free(cur);
    return head;
}

int contains(Node *head, int value) {
    while (head) {
        if (head->value == value) return 1;
        head = head->next;
    }
    return 0;
}

void print_list(Node *head) {
    while (head) {
        printf("%d ", head->value);
        head = head->next;
    }
    printf("\n");
}

void free_list(Node *head) {
    while (head) {
        Node *tmp = head;
        head = head->next;
        free(tmp);
    }
}

int main(void) {
    Node *list = NULL;
    list = insert_head(list, 30);
    list = insert_head(list, 20);
    list = insert_head(list, 10);

    printf("Contains 20: %d\n", contains(list, 20));
    list = delete_value(list, 20);
    print_list(list);

    free_list(list);
    return 0;
}

1
2

Contains 20: 1
10 30