C语言递归实现二叉树的建立

1、C语言递归实现二叉树的建立，先序，中序，后序遍历操作及结点数和树的高度计算#include #define ElemType char/节点声明，数据域、左孩子指针、右孩子指针typedef struct BiTNode char data; struct BiTNode *lchild,*rchild;BiTNode,*BiTree;/先序建立二叉树BiTree CreateBiTree() char ch; BiTree T; scanf(%c,&ch); if(ch=#)T=NULL; else T = (BiTree)malloc(sizeof(BiTNode); T-data = c

2、h; T-lchild = CreateBiTree(); T-rchild = CreateBiTree(); return T;/返回根节点/先序遍历二叉树void PreOrderTraverse(BiTree T) if(T) printf(%c,T-data); PreOrderTraverse(T-lchild); PreOrderTraverse(T-rchild); /中序遍历void InOrderTraverse(BiTree T) if(T) InOrderTraverse(T-lchild); printf(%c,T-data); InOrderTraverse(T-r

3、child); /后序遍历void PostOrderTraverse(BiTree T) if(T) PostOrderTraverse(T-lchild); PostOrderTraverse(T-rchild); printf(%c,T-data); /求树的结点数int numofnode(BiTree T)if (NULL = T)return 0;elsereturn (numofnode(T-lchild) + numofnode(T-rchild)+1);/求树的深度int depth(BiTree T)int h,lh,rh;if (NULL = T)h = 0;elselh

4、=depth(T-lchild);rh=depth(T-rchild);if (lh = rh)h = lh+1;elseh = rh+1;return h;/求叶子结点数int leafNum(BiTree T) int Lleaf,Rleaf; if(T=NULL) return 0; else if(T-lchild=NULL&T-rchild=NULL) return 1;else Lleaf=leafNum(T-lchild); Rleaf=leafNum(T-rchild); return(Lleaf+Rleaf); void main() BiTree T; T = CreateBiTree();/建立 printf(先序遍历：n); PreOrderTraverse(T);/输出printf(n);printf(中序遍历：n); InOrderTraverse(T);/输出printf(n);printf(后序遍历：n); PostOrderTraverse(T);/输出printf(n); printf(该树结点数为:n%dn,numofnode(T