链表操作留给自己

创建

typedef struct node{
   int data;
   struct node *next;
  }node_t;

   static node_t *mk_node(int val)
  {
  node_t *p = malloc(sizeof(node_t));
  if(p != NULL){
 p->data = val;
  p->next = NULL;
  }
  return p;
  }

插入

node_t *link_insert(node_t *head, int val)
  {
  node_t *cur = mk_node(val);
  node_t *tail;

  if(cur == NULL || head == NULL){
  if(head == NULL)
  head = cur;
  return head;
  }

  for(tail = head; tail->next != NULL; tail = tail->next)
  ;
  tail->next = cur;
  return head;
  }

显示

void link_show(node_t *head)
  {
  node_t *cur;

  for(cur = head; cur != NULL; cur = cur->next)
  printf("--%d--\n", cur->data);
  }

销毁

void link_print_destroy(node_t *head)
  {
  node_t *cur, *next;

  for(cur = head; cur != NULL; cur = next){
  next = cur->next;
  printf("--%d--\n", cur->data);
  free(cur);
  }
  }

删除结点

node_t *del_node(node_t *head)
  {
  char str[20];
  node_t *cur, *pre, *del;

  printf("input a name:");
  scanf("%s", str);

  pre = cur = head;
  while(cur){
  if(!strcmp(cur->name, str)){
  del = cur;
  if(cur == head){
  head = pre = cur = cur->next;
  }else{
  pre->next = cur = cur->next;
 }
  free(del);
  }else{
  pre = cur;
  cur = cur->next;
  }
     }
  return head;
  }

创建双链表

typedef struct node *link_t;

  typedef struct node{
  unsigned char item;
  link_t prev, next;
  }node_t;
link_t make_node(unsigned char item)
  {
  link_t p = malloc(sizeof(node_t));
  if(p != NULL){
  p->item = item;
  p->prev = p->next = NULL;
  }
  return p;
  }

创建二

node_t *make_node(int data, node_t *next)
 13 {
 14 node_t *cur = malloc(sizeof(node_t));
 15 cur->data = data;
 16 cur->next = next;
 17 return cur;
 18 }
 19 int i;
 23 node_t *cur, *del;
 24
 25 cur = make_node(1, NULL);
 26 cur->next = cur;
 27
 28 for(i = 2; i <= PERSONS; i++)
 29 cur = cur->next = make_node(i, cur->next);