seqstack.h

数据结构学习中很重要的一章顺序栈

#include <iostream>
using namespace std;

const int StackSize=10;
template <class T>
class SeqStack
{
private:
	T data[StackSize];
	int top;
public:
	SeqStack()   {top=-1;}
	~SeqStack()  {}
	void Push(T x);
	T Pop();
	T GetTop()  {if(top!=-1)  return data[top];}
	bool Empty() {	if(top==-1) return 1;else return 0;}

};