求二叉树的深度 题目编号:376
采用先序法建立一棵二叉树,设计求该二叉树的深度,二叉树的数据域类型为字符型,扩展二叉树的叶子结点用‘#’表示,要求可以求多棵二叉树的深度,当二叉树的深度为0时程序结束。
输入描述
循环输入多棵扩展二叉树的先序遍历序列,每棵树占一行,以回车结束,每棵二叉树中结点之间以空格隔开
输出描述
输出各二叉树的深度,每次输出后面都换行
输入样例
A B # # C D # E # F # # G H # I K # # # #
A B D H # # I # # E J # # K # # C F L # # M # # G N # # O # #
#
输出样例
6
4
0
#include<iostream>
using namespace std;
struct BiNode{
char data;
BiNode*lchild;
BiNode*rchild;
};
class Bitree{
public:
Bitree(){root=Create(root);};
~Bitree(){Release(root);};
public:
int Treedepth(){Treedepth(root);};
public:
BiNode*Create(BiNode*bt);
int Treedepth(BiNode*bt);
void Release(BiNode*bt);
BiNode*root;
};
int Bitree::Treedepth(BiNode*bt){
if(bt==NULL)return 0;
else{
int ldepth=Treedepth(bt->lchild);
int rdepth=Treedepth(bt->rchild);
return ldepth>rdepth? (ldepth+1) : (rdepth+1);
}
}
BiNode*Bitree::Create(BiNode*bt){
char ch;
cin>>ch;
if(ch=='#')bt=NULL;
else{
bt=new BiNode;bt->data=ch;
bt->lchild=Create(bt->lchild);
bt->rchild=Create(bt->rchild);
}
return bt;
}
void Bitree::Release(BiNode*bt){
if(bt!=NULL){
Release(bt->lchild);
Release(bt->rchild);
delete bt;
}
}
int main(){
while(1){
Bitree T;
T.Treedepth();
cout<<T.Treedepth();
if(T.Treedepth()==NULL)break;
}
return 0;
}