链表

 

typedef struct person

{

     char name[10];

     int age;

     struct person *next;

}PERSON;

 

PERSON *head;

 

建立链表:

void lcreate()

{

      PERSON *pb;

      char ch;

      do

      {

            pb = (PERSON *) malloc(sizeof(PERSON));

            if(!pb)

            {

                        exit(1);

            }

            gets(pb->name);

            get(pb->age);

            linsert(pb);

            printf("是否输入下个数？");

            

            ch = getchar();

      }while(ch == 'y' || ch == 'Y');

}

插入节点:

 

 

将新节点插入到链表的末尾

void linsert(PERSON *p)

{

      PERSON *pa,*pb;

 

      pb = head;

      if(head == NULL)

            head = p;

      else

      {

            while(pb)

            {

                  pa =pb;

                  pb=pb->next;

            }

            pa->next = p;

      }

      p->next = NULL;

}