struct tree  //樹的結構
{
	struct tree *left;
	int data;
	struct tree * right;
};

typedef struct tree treenode; //新的樹類型
typedef treenode * b_tree;//樹類型指針

struct Stack
{
	b_tree *top; 
	b_tree *base;
	int stacksize;
};
typedef struct Stack TrStack;

/*函數原型聲明*/
b_tree create_btree(int *nodelist, int position);  //建立二叉樹
void inorder_print_btree(b_tree point);//中序遍歷打印節點內容

void InitStack(TrStack &S);//棧的初始化
int StackEmpty(TrStack S); //判斷棧是否為空
b_tree GetTop(TrStack S,b_tree &p); //取棧頂元素
void Push(TrStack &S,b_tree node); //壓棧
int Pop(TrStack &S,b_tree &p); //出棧
void PostorderTraverse(b_tree T); //非遞歸遍歷二叉樹