求二叉樹的深度葉子結(jié)點數(shù)總結(jié)點數(shù)

1、word#include"malloc.h"#define NULL 0#include"stdio.h"typedef struct nodechar data;struct node *lchild,*rchild;NODE;int count;NODE *crt_bt_pre()/*二叉樹先序創(chuàng)立算法*/NODE * bt;char ch;printf("nttt");scanf("%c",&ch);getchar();if(ch=' ') bt=NULL; else bt=(NODE

2、*)malloc(sizeof(NODE); bt->data=ch; printf("nttt請輸入%c結(jié)點的左孩子:",bt->data); bt->lchild=crt_bt_pre(); printf("nttt請輸入%c結(jié)點的右孩子:",bt->data); bt->rchild=crt_bt_pre(); return(bt);void Preorder(NODE* bt)/*二叉樹先序遞歸遍歷算法*/if(bt!=NULL)printf("nttt %c",bt->data); Pre

3、order(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 Count

4、Leaf(NODE *bt)/*求二叉樹葉子結(jié)點數(shù)的遞歸遍歷算法*/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)/*求二叉樹結(jié)點數(shù)的遞歸遍歷算法*/if(bt=NULL) return 0;elsecount+;CountNode(bt->lchild);CountNode(bt->rchild);r

5、eturn(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、quot;nttt*");printf("nttt* 1-建二 差樹 *");printf("nttt* 2-先序 遍歷 *"); printf("nttt* 3-中序 遍歷 *");printf("nttt* 4-后序 遍歷 *");printf("nttt* 5-統(tǒng)計 葉子數(shù) *");printf("nttt* 6-統(tǒng)計 結(jié)點數(shù) *");printf("nttt* 7-求二叉樹深度 *");printf("nttt* 0-退 出 *

7、");printf("nttt*");printf("ttt請選擇菜單號(0-7):");scanf("%c",&choice);getchar();if(choice='1') printf("nttt請輸入按先序建立二叉樹的結(jié)點序列: "); printf("nttt說明: 逐個輸入,輸入空格代表后續(xù)結(jié)點為空,按回車輸入下一個結(jié)點."); printf("nttt請輸入根結(jié)點: "); bt=crt_bt_pre(); printf(&q

8、uot;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個葉子結(jié)點。n",count);else if(choice='6')count=0;x=CountNode(bt);printf("nttt該二叉樹共有%d個葉子結(jié)點。n",count);else if(choice='7&#