_lklist.c

数据结构的全部课件（机密文件）

#include<stdio.h>
#include<malloc.h>
struct  node
        { int  data;
          struct  node  *next;
        };
typedef  struct node   *pointer, *lklist;

lklist  setup1 ( )
    { lklist head; pointer  p;  int x;
      head=( lklist )malloc(sizeof(lklist) );
      head->next=0;   scanf("%d",&x);
      while  (x!=-32768)
       {   p=(pointer )malloc(sizeof(pointer)) ; p->data=x;
            p->next=head->next;
            head->next=p;
	    scanf("%d",&x);
       };
      return(head);
        };
void  insert1 (lklist la, int x,int y)
   { pointer q,p;
               q=la;  p=la->next;
               while (p->data!=x  && p!=0)
                    {q=p ; p=p->next;};
              p=( lklist )malloc(sizeof(lklist) );
               p->data=y;
               p->next=q->next; q->next=p;
              
           };
void  delete1(lklist la, int x)
  
    { pointer p,q;
     p=la;
     while (p->next->data!=x && p->next)
               p=p->next;
     if  (p->next!=0)
       { q=p->next;   p->next=q->next;free(q);}
     else  printf("ERROR");  
      }                 

void  display (lklist  head)
    { pointer  p;
      p=head->next;

      while  (p!=0)
       {   printf("    %d",p->data ); p=p->next;};

        }
main()
{ lklist h1;
  h1=setup1();
  display(h1);

  insert1 (h1, 2,3);
  delete1(h1,3);
  display(h1);
}