链表查人能插入，但是最后不能显示出来，只能显示初始的一个
怀疑是主程序哪里出错

  #include "stdio.h"
#include "malloc.h"
#define NULL 0
#define LEN sizeof(struct student)
struct student
{
    long num;
    float score;
    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("%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("\nNow,These %d records are:\n",n);
    p= head;
    if(head != NULL)
        do
        {
            printf("%ld %5.1f\n",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)
        /*p1指向的不是所要找的结点，并且后面还有结点*/
    {p2=p1;p1=p1->next;}
    if(num == p1->num)
    {
        if(p1==head) head = p1->next;
        else p2->next = p1->next;
        printf("delete:%d\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;
            p1 = p1->next;
            if(p0->num <= p1->num)
            {
                if(head == p1) head = p0;
                else p2->next = p0;
                p0->next = p1;
            }
            else
            {
                p1->next = p0;
                p0->next = NULL;
            }
          
        }
        n=n+1;
        return(head);
    }
}
/*main()
{
    struct student *head, stu;
    long del_num;
    printf("input records:\n");
    head  = creat();
    print(head);
    printf("\ninput the deleted number:");
    scanf("%ld",&del_num);
    head = del(head,del_num);
    print(head);
    printf("\input the inserted record:");
    scanf("%ld,%f",&stu.num,&stu.score);
    head=insert(head,&stu);
    print(head);
  
}*/
void main()
{
    struct student * head,* stu;
    long del_num;
    printf("input records:\n");
    head = creat();
    print(head);
    printf("\ninput the deleted number:");
    scanf("%ld",&del_num);
    while(del_num != 0)
        {
            head = del(head,del_num);
            print(head);
            printf("input the deleted number:");
            scanf("%ld",&del_num);
        }
  printf("\ninput the inserted record:");
  stu = (struct student *)malloc(LEN);
  scanf("%ld,%f",&stu->num,&stu->score);
  while(stu->num != 0)
      {
        head = insert(head,stu);
        print(head);
        printf("input the inserted record:");
        stu = (struct student *)malloc(LEN);
        scanf("%ld,%f",&stu->num,&stu->score);
      }
  
}

了

  else
    {
        while((p0->num > p1->num) && (p1->next != NULL))        //这里如果当前记录num小于第一条的num
        {
            p2 = p1;
            p1 = p1->next;
            if(p0->num <= p1->num)
            {
                if(head == p1) head = p0;
                else p2->next = p0;
                p0->next = p1;
            }
            else
            {
                p1->next = p0;
                p0->next = NULL;
            }
         
        }                                    //会直接跳到这里，也就没有执行插入了
        n=n+1;
        return(head);
    }


[ 本帖最后由 czsbc 于 2011-9-9 00:36 编辑 ]

额 你这个指针真多有点乱……再看

谢谢
原来是这里出错了