LinkedList.h/LinkedList.c

singleLinkedList.h

#ifndef SINGLELINKEDLIST_H
#define SINGLELINKEDLIST_H
 
typedef int element;
typedef struct ListNode {
    element data;
    struct ListNode *link;
}Node;
 
Node* create_node(element data, Node* link);
void insert_node(Node** phead, Node* p, Node* newNode);
void remove_node(Node** phead, Node* p, Node* removed);
void display(Node* head);
void display_recur(Node* head);
Node* reverse(Node* head);
void remove_all_nodes(Node** phead);
 
#endif // !SINGLELINKEDLIST_H

singleLinkedList.h

#include <stdio.h>
#include <stdlib.h>
#include "singleLinkedList.h"
Node* create_node(element data, Node* link) {
    Node* newNode = (Node*)malloc(sizeof(Node));
    newNode->data = data;
    newNode->link = link;
    return newNode;
}
void insert_node(Node** phead, Node* p, Node* newNode) {
    if (*phead == NULL) {
        newNode->link = NULL;
        *phead = newNode;
    }
    else if (p == NULL) {
        newNode->link = *phead;
        *phead = newNode;
    }
    else {
        newNode->link = p->link;
        p = newNode;
    }
}
void remove_node(Node** phead, Node* p, Node* removed) {
    if (p == NULL) {
        *phead = (*phead)->link;
    }
    else {
        p->link = removed->link;
    }
    free(removed);
}
void remove_all_nodes(Node** phead) {
    Node* p = (*phead);
    while (p != NULL) {
        *phead = (*phead)->link;
        free(p);
        p = *phead;
    }
}
void display(Node* head) {
    do {
        printf("%d\n", head->data);
        head = head->link;
    } while (head != NULL);
    puts("");
}
void display_recur(Node* head) {
    if (head == NULL) {
        puts("");
        return;
    }
    printf("%d\n", head->data);
    display_recur(head->link);
}
Node* reverse(Node* head) {
    Node *p, *q, *r;
    p = head;
    q = NULL;
    while (p != NULL) {
        r = q;
        q = p;
        p = p->link;
        q->link = r;
    }
    return q;
}
Node* reverse_recur(Node* p, Node* before) {
    if (p == NULL) return before;
    Node* next = p->link;
    p->link = before;
    return reverse_recur(next, p);
}