实现链表的基本功能：，创建、输出、删除、插入
本人是新手，麻烦多一点注释
多谢

List CreateListF()
{
   char ch;
   LinkList head;//头指针
   ListNode *s;//工作指针
   head=Null;//链表开始为空
   ch=getchar();//读取第一个字符;
   which(ch!='\n')
  {
     s=(ListNode *)malloc(sizeof(ListNode));//生成新结点
     s->Date=ch;//将读入的数据插入新结点的数据域中
     s->next=head;//将指针指向头
     ch=getchar();
  }
  return head;//返回头指针
}

谢谢

#include<stdio.h>
#include<malloc.h>
#define NUII 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,There %d records are:\n",n);
    p=head;
    if(head!=NULL)
        do
        {
            printf("%ld %5.1lf\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");
 
    }
    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,*p2,*p1;
    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);
}
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("\ninput the deleted number:");
        scanf("%ld",&del_num);
    }
    printf("\n input 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);
    }
}
这个就是整个的链表的建立。。删除。。和插入