二叉树子系统.docVIP

#includestdio.h #include stdlib.h #define TREEMAX 100 typedef struct BT // 定义二叉树结构体 { char data; struct BT* lchild; struct BT* rchild; }BT; BT *CreateTree(); void ShowTree(BT *T); void Preorder(BT *T); void Postorder(BT *T); void Levelorder(BT *T); void Inorder(BT *T); void Leafnum(BT *T); void Nodenum(BT *T); int TreeDepth(BT *T); int count=0; // 定义计算结点个数的变量 void main() { BT *T=NULL; char ch1,ch2,a; ch1=y; while(ch1==y||ch1==Y) { printf(\n); printf(\n\t\t 二叉树子系统); printf(\n\t\t************************************); printf(\n\t\t*