求二叉树的深度

#include<stdio.h>#include<stdlib.h>typedef struct BTNode{    struct BTNode *lchild,*rchild;    int data;}BTNode,*btnode;void createBtree(btnode &T){    int t;    scanf("%d",&t);    if(t==0)        T=NULL;    else    {        T=(btnode)malloc(sizeof(BTNode));        T->data=t;        createBtree(T->lchild);        createBtree(T->rchild);    }}int getDepth(btnode &T){    int LD,RD;    if(T==NULL)        return 0;    else    {        LD=getDepth(T->lchild);        RD=getDepth(T->rchild);        return (LD>RD?LD:RD)+1;    }}void main(){    btnode T;    int depth;    createBtree(T);    depth=getDepth(T);    printf("depth=%d\n",depth);}