关于栈的链式结构输出问题

#include<stdio.h>

#include<stdlib.h>

#define OK 1

#define ERROR 0

#define OVERFLOW -2

#define NULL 0

typedef int ElemType;

typedef struct Node

{

	ElemType date;

	struct Node *next;

}StackNode;

//初始化

StackNode *InitStack(StackNode *top)

{

//	top=(StackNode *)malloc(sizeof (StackNode));

//	if(!top) exit (OVERFLOW);

	top=NULL;

	return top;

}

//判空栈

int EmptyStack(StackNode *top)

{

	if(top==NULL) return OK;

	else return ERROR;

}

//压栈

StackNode *PushStack(StackNode *top,ElemType e)

{

	StackNode *p=(StackNode *)malloc(sizeof (StackNode));

	p->date=e;

	p->next=top;

	top=p;

	return top;

}

//弹栈

StackNode *PopStack(StackNode *top,ElemType &e)

{

	StackNode *p=NULL;

	if(EmptyStack(top))

	{

		printf("Stack Underflow!");

		return p;

	}

	e=top->date;

	p=top;

	top=top->next;

	free(p);

	return top;

}

//取栈顶

ElemType GetStack(StackNode *top)

{

	if(EmptyStack(top))

	{

		printf("Stack Underflow!");

		return OVERFLOW;

	}

	return(top->date);

}

//输入

StackNode *CreatStack(StackNode *top)

{

	ElemType e;

	scanf("%d",&e);

	while(e)

	{

		top=PushStack(top,e);

		scanf("%d",&e);

	}

	return top;

}

//输出

void print(StackNode *top)

{

	

	StackNode *p;

	p=top;

	ElemType e;

	while(!EmptyStack(p))

	{

//		p=PopStack(p,e);

		e=p->date;

		p=p->next;

		printf("%d\t",e);

	}

	printf("\n");

}

void main()

{

	ElemType e;

	StackNode *top;

	top=InitStack(top);

	printf("请输入一组数字（以0结束）：\n");

	top=CreatStack(top);

	printf("堆栈为：\n");

	print(top);

	top=PopStack(top,e);

	printf("删除栈顶元素%d:\n",e);

	printf("新的堆栈为：\n");

	print(top);

	e=GetStack(top);

	e=top->date;

	printf("现在栈顶元素为：%d\n",e);

	printf("堆栈为：\n");

	print(top);

}