1172

Dbllink

#include <stdio.h>
#include <stdlib.h>
struct dblnode
{
int num;
struct dblnode *prior;
struct dblnode *next;
};
typedef struct dblnode Dblnode;
typedef struct dblnode *Dblink;


void is_malloc_ok(Dblink *new_node)
{
if((*new_node)==NULL)
{
printf("malloc fail!\n");
exit(1);
}
}
void creat_dblink(Dblink *head)
{
*head = (Dblink)malloc(sizeof(Dblnode));
is_malloc_ok(head);
(*head)->next = (*head)->prior = *head;
}


void creat_newnode(Dblink *new_node)
{
(*new_node)=(Dblink)malloc(sizeof(Dblnode));
is_malloc_ok(new_node);
}


void display_dblnode(Dblink *head)
{
Dblink temp = (*head)->next;
while(temp!=*head)
{
printf("num=%d\n",temp->num);
temp = temp->next;
}
printf("\n");
}


void insert_node_head(Dblink *head,Dblink new_node)
{
new_node->next = (*head)->next;
new_node->prior = *head;
(*head)->next->prior = new_node;
(*head)->next = new_node;
if((*head)->prior = *head)
{
(*head)->prior = new_node;
}
}


void insert_node_tail(Dblink *head,Dblink new_node)
{
Dblink temp = *head;
while(temp->next != *head)
{
temp=temp->next;
}
temp->next = new_node;
new_node->next = *head;
new_node->prior = temp;
(*head)->prior = new_node;
}
void delete_node(Dblink *head,int num)
{
Dblink temp = (*head)->next;
while(temp->num != num)
{
temp = temp->next;
}
temp->prior->next = temp->next;
temp->next->prior = temp->prior;
free(temp);
}


void deleteall(Dblink *head)
{
Dblink temp = (*head)->next;
Dblink p = temp;
if(temp == *head)
{
printf("link is empty!\n");
return;
}
while(temp->next != *head)
{
temp = temp->next;
free(p);
p = temp;
}
(*head)->next = *head;
(*head)->prior = *head;
free(temp);


}
int main()
{
    Dblink head = NULL;
    Dblink new_node = NULL;
    int i;
int num;


creat_dblink(&head);


for(i = 0; i < 10;i++)
{
        creat_newnode(&new_node);
new_node->num = i;
insert_node_head(&head,new_node);
// insert_node_tail(&head,new_node);
// scanf("%d\n",&new_node->num);
// insert_node_midd(&head,&new_node,new_node->num);
}


display_dblnode(&head);


// printf("please input a num!\n");
// scanf("%d",&num);


// creat_newnode(&new_node);
// new_node->num =  num;


// insert_node_mid(&head,new_node,10);
    
// delete_node(&head,num);
deleteall(&head);


display_dblnode(&head);
    return 0;
}