请大家帮帮忙看看这个程序 ，谢谢……
#include <stdio.h>
#include <stdlib.h>
#include <malloc.h>
#define MAX 50

typedef struct BNode{
    char data;
    struct BNode *lchild;
    struct BNode *rchild;
}BNode，*BiTree;

//插入新结点
int InsertNode(BiTree *T,char e){
    BNode *f,*p;
    p=*T;
    while(p){
        f=p;
        if(p->data==e) return 0;
        else if(e<p->data) p=p->lchild;
        else p=p->rchild;
    }
    p=(BiTree)malloc(sizeof(BNode));
    p->data=e;
    p->lchild=NULL;
    p->rchild=NULL;
    if(*T==NULL) *T=p;
    else if(e<f->data) f->lchild=p;
    else f->rchild=p;
    return 1;
}

//二叉排序树的创建
BiTree Creat(BiTree T){
    //BiTree T=NULL;
    T=NULL;
    char e;
    scanf("%c",&e);
    while(e!='#'){
        InsertNode(&T,e);
        scanf("%c",&e);
    }
    return T;
}

//前序遍历二叉树
int ProTree(BiTree T){
    BiTree p=T;
    if(p==NULL) return 0;
    printf("%c",p->data);
    ProTree(p->lchild);
    ProTree(p->rchild);
    return 1;
}

//中序遍历二叉树
int MidTree(BiTree T){
    BiTree p=T;
    if(p==NULL) return 0;
    MidTree(p->lchild);
    printf("%c",p->data);
    MidTree(p->rchild);
    return 1;
}

//后序遍历二叉树
int BacTree(BiTree T){
    BiTree p=T;
    if(p==NULL) return 0;
    BacTree(p->lchild);
    BacTree(p->lchild);
    printf("%c",p->data);
    return 1;
}

//中序遍历的非递归算法
void UmidTree(BiTree T){
    BNode *a[MAX],*p;
    int top=0;
    p=T;
    a[top]=p;
    top++;
    while(top){
        while(p){
            a[top]=p->lchild;
            top++;
            p=p->lchild;
        }
        top--;
        p=a[top];
        if(top!=0){
            printf("%c",p->data);
            top--;
            a[top]=p->rchild;
            p=p->rchild;
        }
    }
}

//层次遍历二叉树
void arrTree(BiTree T){
    BNode *a[MAX],*p;
    int top=0,base=0,i=0;
    p=T;
    a[base]=p;
    a[top]=p;
    top++;
    i++; //判断栈是否有空
    while(i){
        printf("%c",p->data);
        i--;
        if(p->lchild!=NULL){
            a[top++]=p->lchild;
            i++;
        }
        if(p->rchild!=NULL){
            a[top++]=p->rchild;
            i++;
        }
        p=a[base++];
    }
}

//查找给定关健字
int search(BiTree T,char k){
    BNode *p=T;
    int i=0,j=0,t=1;
    while(t&&p){
        if(k==p->data) t=0;
        else if(k<p->data){
            p=p->lchild;
            search(p,k);
            i++;j=j*2;
        }
        else{
            p=p->rchild;
            search(p,k);
            i++;j=j*2+1;
        }
    }
    if(p==NULL){
        printf("do not find the word!:");
        return 0;
    }
    else{
        printf("%c,%c",i,j);
        return 1;
    }
}

//二叉树深度算法
int Depth(BiTree T){
    BNode *p=T;
    int ldepth,rdepth;
    while(T!=NULL){
        if(p->lchild!=NULL){
            p=p->lchild;
            ldepth=Depth(p);
        }
        if(p->rchild!=NULL){
            p=p->rchild;
            rdepth=Depth(p);
        }
        if(ldepth>=rdepth)
            return ldepth;
        else return rdepth;
    }
    //if(T==NULL)
    return 1;
}

//计算二叉树叶子数
int Nleave(BiTree T){
    BNode *p=T;
    int i=0;
    while(p){
        if(p->lchild!=NULL){
            p=p->lchild;
            Nleave(p);
        }
        if(p->rchild!=NULL){
            p=p->rchild;
            Nleave(p);
        }
        if(p->lchild==NULL&&p->rchild==NULL) i++;
    }
    return i;
}

//交换各结点的左右子树
void xchangNode(BiTree T){
    BNode *p=T;
    BNode *q;
    while(p){
        if(p->lchild!=NULL){
            p=p->lchild;
            xchangNode(p);
        }
        if(p->rchild!=NULL){
            p=p->rchild;
            xchangNode(p);
        }
        q=p->rchild;
        p->rchild=p->lchild;
        p->lchild=q;
    }
}

void main(){
    BiTree T;
    Creat(T);
    ProTree(T);
    //printf("\n");
    //MidTree(T);
    //printf("\n");
    //BacTree(T);
    //printf("\n");
    //UmidTree(T);
    //printf("\n");
    printf("%d",Depth(T));
}