双向链表(链表尾加数据链表头加数据删除销毁)

#include"list.h"

 

//创建一个空的链表 

struct  node  *list_create(int size)

{

struct node *head  = NULL;

}

int list_addtail(struct node *head, void *dat)

{

 

}

int list_addhead(struct *head,void *dat)

 

 

void  list_destroy(struct node **root)

{

          struct node *head,*cur,*next;

          head = *root;

          for(cur = head; cur != NULL;cur = next)

          {

      

           }

 

}