顺序栈

#include<iostream>
using namespace std;

const int StackSize=50;
template<class T>
class SeqStack
{
public:
	SeqStack();
	~SeqStack(){}
	void Push(T x);
	T Pop();
	T GetTop();
	int Empty();
private:
	T data[StackSize];
	int top;
};

template<class T>
SeqStack<T>::SeqStack()
{
	top=-1;
}
template<class T>
void SeqStack<T>::Push(T x)
{
	if(top==StackSize-1)throw"上溢";
	top++;
	data[top]=x;
}
template<class T>
T SeqStack<T>::Pop()
{
	T x;
	if(top==-1)throw"下溢";
	x=data[top--];
	return x;
}
template<class T>
T SeqStack<T>::GetTop()
{
	if(top!=-1)
		return data[top];
	else 
		return 0;
}
template<class T>
int SeqStack<T>::Empty()
{
	if(top==-1)return 1;
	else return 0;
}
void main()
{
	SeqStack<int>S;
	if(S.Empty())
		cout<<"栈为空"<<endl;
	else
		cout<<"栈非空"<<endl;
	cout<<"对15和20执行入栈操作"<<endl;
	S.Push(15);
	S.Push(20);
	cout<<"栈顶的元素为:"<<S.GetTop()<<endl;
	cout<<"执行一次出栈操作"<<endl;
	S.Pop();
	cout<<"栈顶元素为:"<<S.GetTop()<<endl;
}