C语言数据结构入门记——线性单链表的插入操作

#include<stdio.h>
#include<string.h>
#include<malloc.h>
typedef struct node 
{
    int height;
    struct node *next;
}list; //建立单链表 
 
list *CreateList(int t) 
{
    int i;
    list *head,*end,*p;
    head=(list*)malloc(sizeof(list));//生成头结点 
    end=head;//尾指针指向头结点 
    for(i=0;i<t;i++) 
    {  
        p= (list *)malloc(sizeof(list));//生成新结点 
        scanf("%d",&p->height);//赋值 
        end->next=p;
        end=p;
    }
    
    end->next = NULL;
    return head;
}


void insert(list *head,int height) 
{    list *s,*z;//引入z结点，为后续转接做准备 
    list *p = head;
    s= (list *)malloc(sizeof(list));//生成一个新的结点 
    s->height=height;
    
    while(p->next!=NULL&&(p->next->height)<height) 
    {
    p = p->next;
    }
    
    if(p->next==NULL)//注意值插在末尾的情况
    {
    p->next=s;
    s->next=NULL;
    
    }
    else
    {
        z=p->next;
        p->next=s;
        s->next=z;
    }
}//插入 
 
void Output(list *head) 
{
    list *r = head->next;
    
    while(r!=NULL) 
    {
        printf("%d ",r->height);
        r = r->next;
    }
}//输出 
 
int main() {
    int num,height;
    list *L;
    scanf("%d %d",&num,&height);
    
    L = CreateList(num);
    
    insert(L,height);
    Output(L);
    
    return 0;
}