c语言——单向链表创建（头插法和尾插法）

#include <stdio.h>
#include <stdlib.h>
int n;
typedef struct Student
{
    int data;
    struct Student *next;
}Stu;
Stu *creat()
{
    Stu *head,*p,*q;
    head   = (Stu*)calloc(1,sizeof(Stu));
    if(!head) exit(0);
    head->next = NULL;
    scanf("%d",&n);
    //头插法
    /*for(int i=0;i<n;i++)
    {
        p = (Stu *)calloc(1,sizeof(Stu));
        if(!p) exit(0);
        scanf("%d",&p->data);
        p->next = head->next;
        head->next=p;
    }*/
    //尾插法
    q = head;
    for(int i=0;i<n;i++)
    {
        p = (Stu *)calloc(1,sizeof(Stu));
        if(!p) exit(0);
        scanf("%d",&p->data);
        q->next = p;
        q = p;
    }
    q->next = NULL;//此时q就是尾结点*/
    return head;
}
int main()
{
    Stu *head,*p;
    head = creat();
    for(p=head->next;p;p=p->next)
    {
        printf("%d ",p->data);
    }
    return 0;
}