带表头节点的双向链表

（尚未完善）

#include <stdio.h>
#include<stdlib.h>
#define MAL_OK 1
#define MAL_ERR 0

typedef struct dblnode
{
int data;
struct Dblnode *prior;
struct Dblnode *next;
}Dblnode;

typedef Dblnode* Link;

int judge(Link head)
{
if(head == NULL)
{
return MAL_ERR;
}
else
{
return MAL_OK;
}
}
void creat_link(Link *head)
{
do
{
*head == (Link)malloc(sizeof(Dblnode));
}while(MAL_ERR == judge(&head));
(*head)->prior == (*head)->next;
(*head)->next == *head;
}

void creat_dblnode(Link *head,Link *new_Dblnode,int i)
{
do
{
*new_Dblnode == (Link)malloc(sizeof(Dblnode));
}while(MAL_ERR == judge(&new_Dblnode));
(*new_Dblnode)->data = i;
}

void head_insert_dblnode(Link head,Link new_Dblnode)
{
if(head->next == head)
{
head->prior = new_Dblnode;
}
else
{
head->next->prior = new_Dblnode;
}
new_Dblnode->prior = head;
new_Dblnode->next = head->next;
head->next = new_Dblnode;
}

int main()
{
Link head == NULL;
Link new_Dblnode == NULL;
int i,num;

creat_link(&head);

for(i=0;i<10;i++)
{
    creat_dblnode(&new_Dblnode,i);
    head_insert_dblnode(head,new_Dblnode);
    //tail_insert_dblnode(head,new_Dblnode);
}

display(head);

printf("Please input the number you want to insert at the end of Dblnode !");
scanf("%d%d",&num,&i);
creat_dblnode(&new_Dblnode,num);
mid_insert_dblnode(head,new_Dblnode,i);
display(head);

printf("Please input the Dblnode you want to delete!");
scanf("%d",&i);
delete_dblnode(head,i);
display(head);

release(&head);
display(head);

return 0;

}