stack.h

二叉树结构的定义

#ifndef STACK_CLASS
#define STACK_CLASS
#include "Bitree.h"
const int maxstacksize =50 ;//栈的大小	

class Stack
{
   private:
	   Bitree* stacklist[maxstacksize];//数组，用于存放栈的元素
	   int top;//栈顶元素（数组下标）
   public:
	   Stack();
	   void push(Bitree*p);
	   Bitree* pop();
	   int StackEmpty();
	   ~Stack(){}
};

Stack::Stack()//top值置为-1
{
	top=-1;
} 
	


void Stack::push(Bitree*p)
{
	if(top==maxstacksize-1)
	{
		cout<<"Stack overflow!"<<endl;
	}
	top++;
	stacklist[top]=p;
}

Bitree* Stack::pop()
{
    Bitree*p;
	if(top==-1)
	{
		cout<<"Attempt to pop an empty stack!"<<endl;
	}
	p=stacklist[top];
	top--;
	return p;
}

int Stack::StackEmpty()
{
	int tag;
	if(top==-1)return(tag=1);
	else return(tag=0);
}

#endif