int treedepth(binarytree *tree){
if(tree==NULL){
return 0;
}
int left = treedepth(tree->left);
int right = treedepth(tree->right);
return (left> right) ? left++: right++;
}
计算树的深度
猜你喜欢
转载自blog.csdn.net/ttomchy/article/details/104780153
今日推荐
周排行