带头结点的链表

#include<stdlib.h>

typedef struct student
{
    int num;
    struct student *next;
}Lstudent,*LPstudent;

void InitLink(LPstudent *phead)
{
    Lstudent *ptr;
    *phead=NULL;
    int n;
    printf("please input number of student:\n");
    scanf("%d",&n);
    while(n>0)
    {
        ptr=malloc(sizeof(Lstudent));
        ptr->num=n;
        ptr->next=*phead;
        *phead=ptr;
        printf("please input number of student:\n");
        scanf("%d",&n);
    }
//----------------------------------------------------------------------------
    ptr=malloc(sizeof(Lstudent));
    ptr->next=*phead;
    *phead=ptr;
//----------------------------------------------------------------------------
}

void printf_link(Lstudent *ptri)
{
//----------------------------------------------------------------------------
    ptri=ptri->next;
//----------------------------------------------------------------------------      
    while(ptri!=NULL)
    {
    printf("%d   ",ptri->num);
    ptri=ptri->next;
    }
}

int main()
{
    LPstudent head;
    InitLink(&head);
    printf_link(head);

}