双向链表

#include<stdio.h>
#include<stdlib.h>


struct dblnode
{
int num;
struct dblnode *prior,*next;
};
typedef struct dblnode Dblnode;
typedef struct dblnode* Dbllink;
int is_malloc_ok(Dbllink *newnode)
{
if((*newnode) == NULL)
{
printf("malloc error!\n");
exit(1);
}
return 0;
}
int create_newnode(Dbllink *newnode)
{
*newnode = (Dbllink)malloc(sizeof(Dblnode));
is_malloc_ok(newnode);
return 0;
}
int create_dbllink(Dbllink *head)
{
create_newnode(head);
(*head)->prior = (*head)->next = *head;
return 0;
}
int insert_node_head(Dbllink *head,Dbllink *newnode)
{
(*newnode)->next = (*head)->next;
(*newnode)->prior = *head;
(*head)->next->prior = *newnode;
(*head)->next = *newnode;


return 0;
}
int insert_node_tail(Dbllink *head,Dbllink *newnode)
{
(*newnode)->prior = (*head)->prior;
(*newnode)->next = *head;
(*head)->prior->next = *newnode;
(*head)->prior = *newnode;
return 0;
}
int display_forword_link(Dbllink *head)
{
Dbllink tmp = (*head)->prior;


if(tmp == *head)
{
printf("only have head_node");
return 0;
}


while(tmp != *head)
{
printf("num = %d\n",tmp->num);
tmp = tmp->prior;
}
return 0;
}
int main()
{
Dbllink head = NULL;
Dbllink newnode = NULL;
int i;
create_dbllink(&head);
for(i=0;i<10;i++)
{
create_newnode(&newnode);
newnode->num = i;
//insert_node_head(&head,&newnode);
insert_node_tail(&head,&newnode);
}


display_forword_link(&head);


    return 0;
}