二叉树的非递归后序遍历

#include <stdio.h>
struct btree
{
	char val;
	struct btree *left;
	struct btree *right;
}btree;

//先序创建一棵二叉树
void CreatBintree(struct btree *&T)
{
	char val;
	val = getchar();
	if( data == NULL)
	{
		T = NULL;
	}
	else
	{
		T = new btree;
		T->val = val;
		CreatBintree(T->left);
		CreatBintree(T->right);
	}
}
//code :后序
void PostOrderTraversal(struct *btree)
{
	btree *Sstack[100],*p;
	int top = -1;//栈顶指针
	int flag = 1;//flag = 1 表示右孩子为空或者已经被访问
	if(T != NULL)
	{
		do
		{
			while(T != NULL)
			{
					top++;
					Sstack[top] = T;
					T = T->left;
			}//将左节点全部入栈

			p == NULL;
			flag = 1;

			while(top > -1 && flag == 1)
			{
				T = Sstack[top];
				if(T->right == p)
				{
					top--;
					printf("%5d\n",T->val);
					p = T;
				}
				else
				{
					T = T->right;
					flag = 0;
				}
			
			}
		}while(top > -1)//栈非空
	}
}
int main()
{
	btree *T;
	CreatBintree(T);
	PostOrderTraversal(T);
	return 0;
}