C语言实现栈的入栈，出栈，后插法

C语言实现栈的后插：
#include <stdio.h>
#include <stdlib.h>

typedef struct node //定义一个节点
{
int data;
struct node *next; //指向下一个节点的指针
}Node;

Node *creatStack() //创建一个栈
{
Node *p,*head,*tail; //定义头，尾指针
p = head = tail = NULL;
int Data;
scanf("%d",&Data);
while(Data>0)
{
p = (Node *)malloc(sizeof(Node)); //为节点申请空间
p->data = Data;
p->next = NULL;
if(head==NULL) head = tail = p; //如果头指针为空将head的指针指向p
else
{
tail->next = p;
tail = p;
}
scanf("%d",&Data);
}
return head; //返回头指针
}

void Print(Node *head)
{
if(head==NULL) return ;
while(head)
{
printf("%d\n",head->data);
head = head->next;
}
}
int main()
{
Node *head = creatStack();
Print(head);
return 0;
}