双向链表的创建，查找，删除

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
/*
双向链表,创建，查找,删除
*/
//定义结构
typedef struct stu
{
    char name[30];
    char sex;
    int num;
    float math;
    float chinese;
    float english;
}STU;
typedef struct node
{
    STU data;
    struct node *pre;
    struct node *next;
}NODE;
//创建空链表
NODE *creatList()
{
    NODE *head = (NODE *)malloc(sizeof(NODE));
    head->pre = head;//自己指向自己，形成回环，自己指向自己很重要。后面插入节点都靠他。
    head->next = head;
    return head;
}
//插入节点
void insertNode(NODE *head)
{
    NODE * cur = (NODE *)malloc(sizeof(NODE));
    printf("------------input student score---------------
");
    printf("pls input name :"); scanf("%s",cur->data.name);getchar();
    printf("pls input sex :");    scanf("%c",&cur->data.sex);
    printf("pls input num :");    scanf("%d",&cur->data.num);
    printf("pls input math :");    scanf("%f",&cur->data.math);
    printf("pls input chinese :");    scanf("%f",&cur->data.chinese);
    printf("pls input english :");    scanf("%f",&cur->data.english);
    cur->next = head->next;
    cur->pre = head;
    head->next = cur;
    cur->next->pre = cur;
}
//遍历链表
void traverList(NODE *head)
{
    NODE *phead = head->next;
    while(phead != head)
    {
        printf("name:%s sex:%c num:%d math:%.2f chinese:%.2f english:%.2f
"
                ,phead->data.name,phead->data.sex,phead->data.num,phead->data.math,phead->data.chinese,phead->data.english);
        phead = phead->next;
    }
}
NODE * searchList(NODE *head,char *p)
{
    NODE *phead = head->next;
    while(phead != head)
    {
        if(strcmp(p,phead->data.name) == 0)
            return phead;
        phead = phead->next;
    }
}
void deleteNode(NODE *p)
{
    p->pre->next = p->next;
    p->next->pre = p->pre;
}
int main(void)
{
    //创建空链表
    NODE * head = creatList();
    //插入节点
    int i;
    for(i = 0;i<4;i++)
        insertNode(head);
    traverList(head);
    //查找结点
    NODE *p =searchList(head,"haha");
    //删除结点
    printf("------------delete---------------
");
    deleteNode(p);
    traverList(head);


    return 0;
}