链表的创建，搜索，删除，释放

#include <stdio.h>
#include <stdlib.h>
/* 创建一个长度为N的链表 */

//链表的存储模型
typedef struct creation{
  int value;
  struct creation *next;
} creat;

//保存链表的头尾结点
typedef struct _list{
  creat *head;
  creat *tail;
} List;

void creat_node (List* pList,int n);//创建链表
void search_link_number(List *pList, int number);//搜索链表
void delete_node(List *pList, int number);//删除结点
void search_all_link(List *pList);//遍历结点
void free_all_link(List *pList);//清除链表

int main()
{
  int n;//链表的长度
  int number;
  List list;
  list.head = list.tail = NULL;
  printf("输入要创建的结点个数：");
  scanf("%d",&n);
  creat_node(&list,n);
  printf("输入要查找的数字：");
  scanf("%d", &number);
  search_link_number(&list, number);
  printf("输入要删除的数字：");
  scanf("%d", &number);
  delete_node(&list, number);
  printf("开始检查整个链表并输出链表数据：");
  search_all_link(&list);
  printf("清除链表\n");
  free_all_link