求二叉树的深度叶子结点数总结点数()

1、#include"malloc.h"#define null 0#include"stdio.h"typedef 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*)ma

2、lloc(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); preorde

3、r(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

4、(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);retur

5、n(count);int treedepth(node* bt)/*求二叉树深度的递归遍历算法*/int x,y;if(bt=null) return 0;elsex=treedepth(bt->lchild); y=treedepth(bt->rchild);if(x>y)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("

6、;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-退 出 *&quo

7、t;);printf("nttt*");printf("ttt请选择菜单号(0-7):");scanf("%c",&choice);getchar();if(choice='1') printf("nttt请输入按先序建立二叉树的结点序列: "); printf("nttt说明: 逐个输入,输入空格代表后续结点为空,按回车输入下一个结点."); printf("nttt请输入根结点: "); bt=crt_bt_pre(); printf("

8、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",count);else if(choice='7