int depth(tnode<char>* t)
{
int leftd;
int rightd;
int d;
if (t == NULL) d = -1;
else
{
leftd = depth(t->left);
rightd = depth(t->right);
d = 1 + (leftd > rightd ? leftd : rightd);
}
return d;
}
获取二叉树的高度(递归)
最新推荐文章于 2022-01-03 21:46:40 发布