二叉树遍历输出.docVIP

#include stdio.h #include stdlib.h //包含了malloc函数 #define ok 1 #define error 0 #define overflow -1 typedef int Status; typedef char TElemType; typedef struct BiTNode { TElemType data; struct BiTNode *lchild,*rchild; }BiTNode,*BiTree; Status CreateBiTree(BiTree T) { char ch; scanf(%c,ch); if(ch== ) T=NULL; else { if(!(T=(BiTNode *)malloc(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) { In