链表 顺序和逆序建立

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

typedef struct node
{
    int date;
    struct node *next;
}node;

node *inputshun(int n)//顺序
{
    node *head, *tail, *p;
    int i;
    head = (node*)malloc(sizeof(node));
    tail = head;

    for(i = 0; i < n; i++)
    {
        p = (node*)malloc(sizeof(node));
        scanf("%d", &p->date);
        tail->next = p;
        tail = p;
        tail->next = NULL;
    }
    return head;
}

node *inputni(int n)//逆序
{
    int i;
    node *head, *p;
    head = (node*)malloc(sizeof(node));
    head->next = NULL;
    for(i = 0; i < n; i++)
    {
        p = (node*)malloc(sizeof(node));
        scanf("%d", &p->date);
        p->next = head->next;
        head->next = p;

    }
    return head;
}

void output(node *head)//输出
{
    node *p;
    p = head->next;
    while(p)
    {
        printf("%d", p->date);
        p = p->next;
        if(p) printf(" ");
        else printf("\n");
    }
}
int main()
{
    node *head;
    int n;
    scanf("%d",&n);
    head = inputni(n);//逆序
    //head = inputshun(n);//顺序
    output(head);
    return 0;
}