《二叉树遍历输出》由会员分享，可在线阅读，更多相关《二叉树遍历输出（3页珍藏版）》请在金锄头文库上搜索。
1、#include #include /包含了malloc函数#define ok 1#define error 0#define overflow -1typedef int Status;typedef char TElemType;typedef struct BiTNodeTElemType data;struct BiTNode *lchild,*rchild;BiTNode,*BiTree;Status CreateBiTree(BiTree &T)char ch;scanf(%c,&ch);if(ch= ) T=NULL; elseif(!(T=(BiTNode *)malloc(
2、sizeof(BiTNode)exit(overflow);T-data=ch;CreateBiTree(T-lchild);CreateBiTree(T-rchild);return ok;Status PreOrder(BiTree T)if(T)printf(%c,T-data);PreOrder(T-lchild);PreOrder(T-rchild); return ok;Status InOrder(BiTree T)if(T)InOrder(T-lchild);printf(%c,T-data);InOrder(T-rchild);return ok;Status PostOrder(BiTree T)if(T)PostOrder(T-lchild);PostOrder(T-rchild);printf(%c,T-data);return ok;void main()BiTree T;printf(请输入字符n);CreateBiTree(T);printf(先序遍历输出：n);PreOrder(T);printf(n);printf(中序遍历输出：n);InOrder(T);printf(n);printf(后序遍历输出：n);PostOrder(T);printf(n);
