头插法链表的基本操作:创建空链表，插入结点，遍历链表，求链表长度，查找结点，删除结点

#include <stdio.h>
#include <stdlib.h>
/*
头插法链表的基本操作：创建空链表，插入节点，遍历输出节点数据，求链表长度，查找结点，删除结点。
*/
typedef struct node
{
    int data;
    struct node * next;
}NODE;
//创建空链表
NODE * createList()
{
    NODE * head = (NODE *)malloc(sizeof(NODE));
    head->next = NULL;

    return head;
}
//头插法插入新节点
void insertNode(NODE * head,int insertData)
{
    NODE * sur = (NODE *)malloc(sizeof(NODE));
    sur->data = insertData;

    sur->next = head->next;
    head->next = sur;

    return;
}
//遍历输出链表结点数据
void traverList(NODE * head)
{
    head = head->next;
    while(head)
    {
        printf("%d\n",head->data);
        head = head->next;
    }

    return;
}
//求链表的长度
int lenNodeList(NODE * head)
{
    int len = 0;
    head = head->next;
    while(head)
    {
        len++;
        head = head->next;
    }

    return len;
}
//查找结点
NODE * lookNodeList(NODE *head,int n)
{
    head = head->next;
    while(head)
    {
        if(head->data == n)
            break;
        else
            head = head->next;
    }
    return head;
}
//删除结点
void deleteNode(NODE * head,NODE * add)
{
    while(head->next !=add)//找前区
    {
        head = head->next;
    }
    head->next = add->next;

    free(add);
}
int main(void)
{
    NODE * head = createList();
    
    for(int i = 0;i<100;i++)
        insertNode(head,i);

    traverList(head);
    int len = lenNodeList(head);
    printf("链表长度为:%d\n\n",len);
    printf("查找数值为33的结点地址\n");
    NODE * add = lookNodeList(head,33);
    if(add == NULL)
    {
        printf("没有找到\n");
    }
    else
    {
        printf("%d的地址为：%p\n\n",add->data,add);
        printf("删除33这个结点\n");
        deleteNode(head,add);
    }
    traverList(head);

    return 0;
}