计算一棵二叉树的高度,请将下列算法填空完整.intHeight(Btree*t){inth1,h2;if(t==NULL)return0;elseif()return1;else{Return(h1>h2?h1:h2)+1;}}

Question

计算一棵二叉树的高度,请将下列算法填空完整.
int Height(Btree *t)
{ int h1,h2;
if(t==NULL)
return 0;
else if ( )
return 1;
else
{
Return (h1>h2?h1:h2)+1;
}
}

Answer 1

...
if( h1 = Height(t->left),h2 =Height(t->right),h1==h2 && h1 == 0 )
...
//// left ,right 左右子节点指针