请用C语言编写一个函数,实现求二叉树高度的算法,并给出结点结构

typedef int Status;
typedef char TElemType;

typedef struct BiTNode{
TElemType data;
struct BiTNode *lchild,*rchild;
}BiTNode,*BiTree;

int GetDepth(BiTree T){
if(!T) return 0;
else{
int depthLeft = GetDepth( T->lchild );
int depthRight= GetDepth( T->rchild );
return (depthLeft>depthRight?depthLeft:depthRight)+1;
}

}