seqstack.h

数据结构头文件源代码

#include <iostream.h>
#include <stdlib.h>
class SeqStack
{
private:
	DataType data[MaxStackSize];
	int top;
public:
	SeqStack(void)
	{top=0;};
	~SeqStack(void)
	{};

	void Push(const DataType& item);
	DataType Pop(void);
	DataTyep Peek(void)const;
	int StackEmpty(void)const;
	{return(top==0);};
	int GetSize(void)const;
	{return top;};
	void ClearStack(void)
	{top=0;}
};

void SeqStack::Push(const DataType& item)
{
	if(top==MaxStackSize)
	{
		cout<<"栈已满!"<<endl;
		exit(0);
	}
      data[top]=item;
	  top++;
}


DataType SeqStack::Pop()
{
	if(top===0)
	{
		cout<<"栈已空!"<<endl;
		exit(0);
	}
	top--;
	return data[top];
}

DataType SeqStack::Peek(void)  const;
{
	if(top==0)
	{
		cout<<"栈已空!"<<endl;
		exit(0);
	}
	return data[top-1];
}