[color=#003399]各位[/color] 麻烦请教关于链表的问题

今天模仿编写了一个链表的函数  可是有很多编译错误（在C++6.0下编译）
 麻烦各位帮忙指点一下

代码如下：包涵 创建 插入 删除  输出的功能
#include<stdio.h>
#include<malloc.h>

#define LEN sizeof(struct student )
#define NULL 0

struct student{
  long num;
  float score;
  struct student *next;

};

int n;

struct student* creat(void){
  struct student *head;
  struct student *p1;
  struct student *p2;

  n=0;
p2=(struct student *)malloc(LEN);
  p1=p2;
  scanf("%ld,%f",&p1->num,&p1->score);

  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("%ld,%f",&p1->num,&p1->score);

  }
p2->next=NULL;

return(head);

}



void print(struct student *head){
   struct student *p;
   printf("now these %d records are :\n");

   p=head;
   if(head!=NULL)
       do{
         printf("%ld %5.1f",p->num,p->score);
         p=p->next;

       }while(p!=NULL);


}


struct student *del(struct student *head,long num)
 {struct student *p1,*p2;
  if (head==NULL)
     {printf("\nlist null!\n");
      return(head);
     }
  p1=head;
  while(num!=p1->num && p1->next!=NULL)
     {p2=p1;p1=p1->next;}
  if(num==p1->num)
     {if(p1==head)head=p1->next;
      else p2->next=p1->next;
      printf("delete:%ld\n",num);
      n=n-1;
     }
  else printf("%ld not been found!\n",num);
  return(head);
}


struct student *insert(struct student *head,struct student *stud)
{struct student *p0,*p1,*p2;
 p1=head;                          //使ｐ１指向第一个结点
 p0=stud;                          //指向要插入的结点
 if(head==NULL)                    //原来的链表是空表
 {head=p0;p0->next=NULL;}          //使ｐ０指向的结点作为头结点
 else
 {while((p0->num>p1->num) && (p1->next!=NULL))
 {p2=p1;                       //使ｐ２指向刚才p１指向的结点
  p1=p1->next;}                //p1后移一个结点
  if(p0->num<=p1->num)
  {if(head==p1) head=p0;        //插到原来第一个结点之前
   else p2->next=p0;            //插到p2指向的结点之后*／
   p0->next=p1;}
  else
  {p1->next=p0; p0->next=NULL;}}  //插到最后的结点之后
   n=n+1;                              //结点数加１
   return (head);
}



int main(){

  struct student* head,*stud;
stud=(struct student *)malloc(LEN);
long num=0;
  head=creat();

  head=insert(head,stud);
  head=del(head,num);
  print(head);
  return 0;

}