//非递归方式建树，并按任一种非递归遍历次序输出二叉树中的所有结点；#include <stdio.h>#include <stdlib.h>#include <malloc.h>#define MaxSize 50typedef char ElemType;typedef struct TNode{ ElemType data; struct TNode *lchild,*rchild; }BTree;//------------------------------------------------------------------------------ ...