void main()
{
char *str = "ABC##DE##F##G#H##";
BinTree mytree;
InitBinTree(&mytree,'#');
CreateBinTree_4(&mytree,str);
PostOrder(&mytree);
printf("\n");
}
void main()
{
BiNode *bt;
bt=(BiNode *)malloc(sizeof(BiNode));
InitBinTree(bt);
CreateBinTree(bt);
preOrder(bt);
printf("非递归先序遍历为：");
//Pre(bt);
printf("\n");
printf("非递归中序遍历为：");
//In(bt);
printf("\n");
printf("非递归后序遍历为：");
//Post(bt);
printf("\n");
}
