学生成绩链表处理

#include <stdio.h>
#include <stdlib.h>

struct stud_node {
     int    num;
     char   name[20];
     int    score;
     struct stud_node *next;
};

struct stud_node *createlist();
struct stud_node *deletelist( struct stud_node *head, int min_score );

int main()
{
    int min_score;
    struct stud_node *p, *head = NULL;

    head = createlist();
    scanf("%d", &min_score);
    head = deletelist(head, min_score);
    for ( p = head; p != NULL; p = p->next )
        printf("%d %s %d\n", p->num, p->name, p->score);

    return 0;
}

/* 你的代码将被嵌在这里 */

struct stud_node *createlist()
{
	struct stud_node *p, *head = NULL,*tail=NULL;
	int num;
	while(scanf("%d",&num) && num){
		p=(struct stud_node *)malloc(sizeof(struct stud_node));
		p->num=num;
		scanf("%s%d",p->name,&p->score);
		p->next=NULL;
		if(head==NULL && tail==NULL){
			head=tail=p;
		} 
		else{
			tail->next=p;
			tail=p;
		}
	}
	return head;
}
struct stud_node *deletelist( struct stud_node *head, int min_score )
{
	struct stud_node *p,*q;
	//要删除的是表头结点
	while(head!=NULL && head->score<min_score){
		q=head;
		head=head->next;
		free(q);
	} 
	if(head==NULL){		//链表为空 
		return NULL; 
	}
	//要删除的不是表头结点
	p=head;
	q=head->next;		//从表头的下一个搜索要删除的结点 
	while(q){
		if(q->score<min_score){
			p->next=q->next;
			free(q);
		}
		else{
			p=q;		//头（p）后移一个结点 
		}
		q=p->next; 		//q 指向 p 的下一个结点 
	}
	return head;
}