#include
#include

#define?STACK_INIT_SIZE?100
#define?STACKINCREMENT?10
#define?OVERFLOW?-2
#define?INFEASIBLE?-1
#define?ERROR?0
#define?FALSE?0
#define?TRUE?1
#define?OK?1

typedef?int?Status;
typedef?char?TElemType;

//---------二叉樹的二叉線索存儲表示-------
typedef?enum?{link?Thread}PointerTag;??//link==0:指針，Thread==1:線索?
typedef?struct?BiThrNode{
	TElemType?data;
	struct?BiThrNode??*lchild?*rchild;????//左右孩子指針
	PointerTag???LTagRTag;????????????//左右標志
}BiThrNode?*BiThrTree;


typedef?BiThrTree?SElemType;
//------Stack的儲存結(jié)構(gòu)----------
typedef?struct?Stack
{
????SElemType?*base;???????//存儲空間的基址在棧構(gòu)造之前和銷毀之后，base的值為NULL
????SElemType?*top;??????????//棧頂指針
????int?stacksize;?????????????//當(dāng)前已分配的存儲空間，以元素為單位
}?SqStack;?????????????????????????//順序棧類