btree_preorder_norecursion_traverse.h

二叉树的各种操作

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 PreorderTraverse(b_tree T); //非递归遍历二叉树