C语言链表的实现

今天再次复习了一下链表的实现

#include <stdio.h>
#include <stdlib.h>
#define OK 0;
#define Error 1;
typedef int Type;
typedef int Status;

typedef struct Node
{
    Type data;
    struct Node *next;
} Node, *List;

void initList(List *L)
{
    *L = (Node *)malloc(sizeof(Node));
    (*L)->next = NULL;
}
void printList(List *L)
{
    Node *node = L;
    while (node->next != NULL)
    {
        node = node->next;
        printf("Node 值:%d\n", node->data);
    }
}
void add(List L, Type i, Type *x)
{
    Node *node = (Node *)malloc(sizeof(Node));
    Node *list = L;
    while (list->next != NULL)
    {
        list = list->next;
    }
    node->data = i;
    *x = i;
    node->next = NULL;
    list->next = node;
    printf("list add:%d\n", *x);
}

void deleteIndex(List L, int position, Type *x)
{
    int i = 0;
    Node *start = L;
    Node *end = L->next;
    while (end->next != NULL && i < position - 1)
    {
        start = start->next;
        end = end->next;
        i++;
    }
    *x = end->data;
    start->next = end->next;
    free(end);
    printf("list  delete:%d\n", *x);
}

void updateIndex(List L, int position, Type value)
{
    int i = 0;
    Node *Node = L->next;
    while (Node->next != NULL && i < position)
    {
        Node = Node->next;
        i++;
    }
    if (i == position && Node->data != NULL)
    {
        Node->data = value;
        printf("list index%d update value%d\n", i, value);
    }
}

void getElemType(List L, int position, Type *x)
{
    int i = 0;
    Node *node = L;
    while (node->next != NULL)
    {
        node = node->next;
        if (i == position && node->data != NULL)
        {
            *x = node->data;
            printf("list select%d", *x);
        }
        i++;
    }
}

Status main()
{
    List l;
    Type i;
    initList(&l);
    add(l, 1, &i);
    add(l, 2, &i);
    add(l, 3, &i);
    add(l, 4, &i);
    add(l, 5, &i);
    printList(l);
    // deleteIndex(l, 2, &i);
    updateIndex(l, 0, 5);
    printList(l);
    getElemType(l, 0, &i);
    return OK;
}