seqstack2.h

包含各种测试,查找和算法等代码,如冒泡算法,树的遍历,链表,队列,堆栈等

class SeqStack
{
private:
	DataType *data[MaxStackSize];		//改为指针类型
	int top;							
public:
	SeqStack(void)   					
		{top = 0;};
	~SeqStack(void)  					
		{};
	
	void Push(DataType *item); 			//入栈
	DataType *Pop(void);       			//出栈
	DataType *GetTop(void)const; 		//取栈顶数据元素
	int NotEmpty(void)const  			//堆栈非空否
    	{return(top != 0);};
};

void SeqStack::Push(DataType *item)		//入栈
//把元素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::GetTop(void)const	//取栈顶数据元素
//改为返回指针类型
{
	if(top == 0)
	{
		cout << "堆栈空!" << endl;
		exit(0);
	}
	return data[top-1];
}