双向循环链表

/*****************************************************************************************************************************

Description ：双向循环链表

Author ：feng

Date ：2015·07·18

*****************************************************************************************************************************/

#include <stdio.h>

#include <string.h>
#include <malloc.h>


#define SUCCESS 0
#define UNSUCCESS -1


struct student
{
    char name[10];
int age;
struct student * prior;
struct student *next;
};


typedef struct student STU;
typedef struct student * Link;


void create(Link *head)
{
    *head = (Link)malloc(sizeof(STU));
(*head)->next = *head;
(*head)->prior = *head;
}


int tail_insert(Link * head,Link *node)
{
    Link temp = (*head)->next;
    
while(temp->next != *head)
   temp = temp->next;


temp->next = *node;
(*node)->next = *head;
(*node)->prior = temp;
(*head)->prior = *node;
}


void mid_insert(Link *head,Link * node,char * str)
{
Link temp = (*head)->next;


while(temp->next != *head)
{
   if(strcmp(temp->name,str) == 0)
{
   (*node)->next = temp->next;
(*node)->prior = temp;
temp->next->prior = *node;
temp->next = *node;
}
temp = temp->next;
}


}


int main()
{
    Link head;
create(&head);
    Link newnode = NULL;


int i = 0;
for(i = 0; i < 3;i ++)
{
   newnode = (Link)malloc(sizeof(STU));
tail_insert(&head,&newnode);
printf("please enter the name of No.%d: ",i + 1);
scanf("%s",newnode->name);
printf("please enter the age of No.%d: ",i + 1);
scanf("%d",&newnode->age);
}
    
char name[10];
newnode = (Link)malloc(sizeof(STU));
printf("after : ");
scanf("%s",name);


mid_insert(&head,&newnode,name);
printf("please enter the name ");
scanf("%s",newnode->name);
printf("please enter the age ");
scanf("%d",&newnode->age);
    
    Link temp = head->next;
    while(temp != head)
{
   printf("name : %s age : %d\n",temp->name,temp->age);
temp = temp->next;
}


return SUCCESS;
}