求二叉树的深度叶子结点数总结点数(免费).doc

#includemalloc.h#define NULL 0#includestdio.htypedef struct nodechar data;struct node *lchild,*rchild;NODE;int count;NODE *crt_bt_pre()/*二叉树先序创建算法*/NODE * bt;char ch;printf(nttt);scanf(%c,&ch);getchar();if(ch= ) bt=NULL; else bt=(NODE*)malloc(sizeof(NODE); bt-data=ch; printf(nttt请输入%c结点的左孩子:,bt-data); bt-lchild=crt_bt_pre(); printf(nttt请输入%c结点的右孩子:,bt-data); bt-rchild=crt_bt_pre(); return(bt);void Preorder(NODE* bt)/*二叉树先序递归遍历算法*/if(bt!=NULL)printf(nttt %c,bt-data); Preorder(bt-lchild);Preorder(bt-rchild);void Inorder(NODE* bt)if(bt!=NULL)Inorder(bt-lchild);printf(nttt %c,bt-data);Inorder(bt-rchild);void Postorder(NODE* bt)if(bt!=NULL)Postorder(bt-lchild);Postorder(bt-rchild);printf(nttt %c,bt-data);int CountLeaf(NODE *bt)/*求二叉树叶子结点数的递归遍历算法*/if(bt=NULL)return 0;if(bt-lchild=NULL&bt-rchild=NULL)count+;CountLeaf(bt-lchild);CountLeaf(bt-rchild);return(count);int CountNode (NODE* bt)/*求二叉树结点数的递归遍历算法*/if(bt=NULL) return 0;elsecount+;CountNode(bt-lchild);CountNode(bt-rchild);return(count);int TreeDepth(NODE* bt)/*求二叉树深度的递归遍历算法*/int x,y;if(bt=NULL) return 0;elsex=TreeDepth(bt-lchild); y=TreeDepth(bt-rchild);if(xy)return(x+1);elsereturn(y+1);void main()NODE *bt;char choice;int j=1;int x;while(j)printf(nnn);printf(ttt-二叉树的基本运算-n);printf(nttt*);printf(nttt* 1-建二 差树 *);printf(nttt* 2-先序 遍历 *); printf(nttt* 3-中序 遍历 *);printf(nttt* 4-后序 遍历 *);printf(nttt* 5-统计 叶子数 *);printf(nttt* 6-统计 结点数 *);printf(nttt* 7-求二叉树深度 *);printf(nttt* 0-退 出 *);printf(nttt*);printf(ttt请选择菜单号(0-7):);scanf(%c,&choice);getchar();if(choice=1) printf(nttt请输入按先序建立二叉树的结点序列: ); printf(nttt说明: 逐个输入,输入空格代表后续结点为空,按回车输入下一个结点.); printf(nttt请输入根结点: ); bt=crt_bt_pre(); printf(nttt二叉树成功建立!n);else if(choice=2)printf(nttt该二叉树的先序遍历序列为: );Preorder(bt);else if(choice=3)printf(nttt该二叉树的中序遍历序列为: );Inorder(bt);else if(choice=4)printf(nttt该二叉树的后序遍历序列为: );Postorder(bt);else if(choice=5)count=0;CountLeaf(bt);printf(nttt该二叉树有%d个叶子结点。n,count);else if(choice=6)count=0;x=CountNode(bt);printf(nttt该二叉树共有%d个叶子结点。n,