数据结构之顺序栈

#include<iostream>
#include<malloc.h>
using namespace std;
#define STACKSIZE 10
#define SIZEADD 5
typedef int ElemType;
typedef struct
{
	ElemType *pBottom;
	ElemType *pTop;
	int Stacksize;
}Stack;
void InitStack(Stack &S)
{
	S.pBottom = new ElemType[STACKSIZE];
	S.pTop = S.pBottom;
	S.Stacksize = STACKSIZE;
}
void DestroyStack(Stack &S)
{
	delete []S.pBottom;
	S.pBottom = NULL;
	S.pTop = NULL;
	S.Stacksize = 0;
}
void ClearStack(Stack &S)
{
	S.pTop = S.pBottom;
}
bool StackEmpty(Stack S)
{
	if (S.pBottom == S.pTop)
	{
		cout << "The Stack is empty !" << endl;
		return true;
	}
	else
		return false;
}
int StackLength(Stack S)
{
	return (S.pTop - S.pBottom);
}
void Visit(ElemType e)
{
	cout << e<<" ";
}
void Push(Stack &S,ElemType e)
{
	if (S.pTop - S.pBottom >= S.Stacksize)
	{
		S.pBottom = (ElemType*)realloc(S.pBottom, (S.Stacksize + SIZEADD)*sizeof(ElemType));
		S.pTop = S.pBottom + S.Stacksize;
		S.Stacksize += SIZEADD;
	}
	*S.pTop++ = e;
	return;
}
void Pop(Stack &S, ElemType &e)
{
	if (StackEmpty(S))	
		return;	
	e = *--S.pTop;	
}
void GetTop(Stack S, ElemType &e)
{
	if (StackEmpty(S))			
		return;	
	e = *(S.pTop - 1);
	return;
}
void TraverseDe(Stack S)
{
	ElemType *pTem=S.pTop;
	if (StackEmpty(S))
		return;
	while (pTem > S.pBottom)
	{
		--pTem;
		Visit(*pTem);
	}
	cout << endl;
	return;
}
void TraverseAs(Stack S)
{
	ElemType *pTem = S.pBottom;
	if (StackEmpty(S))
		return;
	while (pTem<S.pTop)
	{
		Visit(*pTem);
		++pTem;
	}
	cout << endl;
	return;
}
int main(void)
{
	Stack S; ElemType e = 0;
	InitStack(S);
	Push(S, 1);
	Push(S, 2);
	Push(S, 3);
	Push(S, 4);
	Push(S, 5);
	Push(S, 6);
	Push(S, 7);
	GetTop(S, e);
	cout << e << endl;
	cout << StackLength(S) << endl;
	TraverseAs(S);
	TraverseDe(S);
	Pop(S, e);
	cout << e << endl;
	Pop(S, e);
	cout << e << endl;
	cout << StackLength(S) << endl;
	TraverseDe(S);
	return(0);
}