链栈入栈与出栈（逆序输出）_数据结构

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

typedef int DataType;
struct Node {
    DataType      data;
    struct Node*  next;
};
typedef struct Node  *PNode;
typedef struct Node  *LinkStack;

// 定义一个栈 
LinkStack SetNullStack_Link() 
{
    LinkStack top = (LinkStack)malloc(sizeof(struct Node));
    if (top != NULL) top->next = NULL;
    else printf("Alloc failure");
    return top; 
}

//判断是否为空栈 
int IsNullStack_link(LinkStack top) 
{
    if (top->next == NULL)
        return 1;
    else
        return 0;
}

//入栈 
void Push_link(LinkStack top, DataType x) 
{
    PNode p;
    p = (PNode)malloc(sizeof(struct Node));
    if (p == NULL)
        printf("Alloc failure");
    else
    {
        p->data = x;
        p->next = top->next;
        top->next = p;
    }
}

//出栈 
void Pop_link(LinkStack top)
{
    PNode p;
    if (top->next == NULL)
        printf("it is empty stack!");
    else
    {
        p = top->next;
        top->next = p->next;
        free(p);
    }
}

//输出栈里面对应的数据 
DataType Top_link(LinkStack top)
{
    if (top->next == NULL)
    {
        printf("It is empty stack!");
        return 0;
    }
    else
        return top->next->data;
}
int main()
{
    LinkStack stackA = SetNullStack_Link();
    DataType data;
    scanf("%d,", &data);
    while (data != -1)
    {
        
        Push_link(stackA,data);
        scanf("%d,", &data);
    }
    while (!IsNullStack_link(stackA))
    {
        
        printf("%d",Top_link(stackA));
        Pop_link(stackA);
    }
    return 0;
}