链表的基本操作

#include<stdio.h>
#include<malloc.h>
#define NULL 0
#define LEN sizeof(struct student)
struct student
{int num;
 char name[10];
 struct student *next;
};
int n;


struct student *creat(void)
{struct student *head;
 struct student *p1,*p2;
 n=0;
 p1=p2=(struct student*)malloc(LEN);
 scanf("%d,%s",&p1->num,&p1->name);
 head=NULL;
 while(p1->num!=0)
 {n=n+1;
  if(n==1)head=p1;
  else p2->next=p1;
  p2=p1;
  p1=(struct student*)malloc(LEN);
  scanf("%d,%s",&p1->num,&p1->name);
 }
 p2->next=NULL;
 return(head);
}