二叉树4（求二叉树的深度）

/*求二叉树的深度*/
# include <stdio.h>
# include <stdlib.h>
typedef char ElemType;
typedef struct BiTNode{
ElemType data;
struct BiTNode* Lchild;
struct BiTNode* Rchild;
}BiTNode,*BiTree;
//构造二叉树
void createbt(BiTree &T){
char ch;
scanf("%c",&ch);
if(ch=='#')T=NULL;
else{
T=(BiTree)malloc(sizeof(BiTNode));
T->data=ch;
createbt(T->Lchild);
createbt(T->Rchild);
}
}
//求二叉树的深度
void BiTreeDepth(BiTree T,int level,int &depth){
//T指向二叉树的根，level为T所指节点最在的层次,初值为1，depth就是我们要求的深度的值
if(T){
if(level>depth)
depth=level;
BiTreeDepth(T->Lchild,level+1,depth);
BiTreeDepth(T->Rchild,level+1,depth);
}
}
void main(){
BiTree T;
printf("create a tree such as ABC##DE#G##F###\n");
createbt(T);
printf("求二叉树的深度:\n");
int depth=0;
BiTreeDepth(T,1,depth);
printf("%d\n",depth);
}