linked_list_test.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

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

int main(){

    node* ll = malloc(sizeof(node));
    ll->value = 1;
    ll->next = NULL;


    print_ll(ll);
    reverse_ll(&ll);
    print_ll(ll);
    /* delete_node(&ll, 0); */

    /* print_ll(ll); */
    /* printf("The length of ll is %d\n", count_ll(ll)); */

    /* delete_node(&ll, 0); */
    /* print_ll(ll); */
    /* printf("The length of ll is %d\n", count_ll(ll)); */
    /* printf("%d\n", search_node(ll, 10)->value); */

    /* printf("%d\n", get_value(ll, 3)); */

    /* free_ll(ll); */
    return 0;
}