【数据结构基础】求二叉树高度

#include<stdio.h>#include<stdlib.h>static  int count=0;typedef struct TreeNode{    char element;    struct TreeNode *left,*right;}Tree,*BTree;BTree BuildTree(void){    BTree T;    char ch;    ch=getchar();    if(ch=='#'){        T=NULL;    }else{        T=(BTree)malloc(sizeof(Tree));        T->element=ch;        T->left=BuildTree();        T->right=BuildTree();    }    return T;}int GetHeight(BTree T){    int LH=0,RH=0,MaxH;    if(T){        LH=GetHeight(T->left);        RH=GetHeight(T->right);        MaxH=LH>RH?LH:RH;        return MaxH+1;     }else{        return 0;    }}int main(void){    BTree T;    int height;    T=BuildTree();    height=GetHeight(T);    printf("%d\n",height);    return 0;}