二叉树的遍历的非递归实现

void InOrderTraversal(BinTree BT)
{
	BinTree T=BT;
	Stack S=CreatStack(MaxSize);
	while(T || !IsEmpty(S))
	{
		while(T)//T存在就压栈，遍历其左子树
		{
			Push(S,T);
			T=T->Left;
		}
		if(!IsEmpty(S))//压入的全部弹出来
		{
			T=Pop(S);
			printf("%d\n",T->Data);
			T=T->Right;//最后将T变成了T的右子节点
		}
	}
}

void PreOrderTraversal(BinTree BT)
{
	BinTree T=BT;
	Stack S=CreatStack(MaxSize);
	while(T || !IsEmpty)(S){
		while(T){
			printf("%d\n",T->Data);
			Push(S,T);
			T=T->Left;
		}
		if(!IsEmpty(S)){
			T=Pop(S);
			T=T->Right;
		}
	}
}