双向循环链表

//双向循环链表
//有头节点
#include <stdio.h>
#include <stdlib.h>
struct node{
    int element;
    struct node* next;
    struct node* previous;
};
void Insert(struct node* head,int number)
{
    struct node* t;
    t=(struct node*)malloc(sizeof(struct node));
    t->element=number;
    t->next=NULL;
    t->previous=NULL;
    if(head->next==head){//插到头节点后
        head->next=t;
        t->next=head;
        head->previous=t;
        t->previous=head;
        return;
    }

    struct node* temp;
    temp=head;
    while(temp->next!=head&&temp->next->element<=number)
        temp=temp->next;
    if(temp->next==head){//插到尾节点后
        temp->next->previous=t;
        t->next=temp->next;
        temp->next=t;
        t->previous=temp;
        return;
    }
    //插到中间
    temp->next->previous=t;
    t->next=temp->next;
    temp->next=t;
    t->previous=temp;
    return;
}
void Delete(struct node* head,int number){
     struct node* temp;
     temp=head;
     while(temp->next!=head&&temp->next->element!=number)
        temp=temp->next;
     if(temp->next->next==head){//删除尾结点
         struct node* d=temp->next;
         head->previous=temp;
         temp->next=head;
         free(d);
         return;
     }
     struct node* d=temp->next;
     temp->next->next->previous=temp;
     temp->next=temp->next->next;
     free(d);
     return;
}
struct node* Init(struct node* head)
{
    head=(struct node*)malloc(sizeof(struct node));
    head->next=head;
    head->previous=head;
    return head;
};

int main(){
    struct node* head;
    //初始化
    head=Init(head);
    //插入
    Insert(head,10);
    //删除
    Delete(head,10);

    return 0;

}