int getHight(TreeNode* node)
{
if(node==NULL) return 0;
if(getHight(node->left)==-1) return -1;
if(getHight(node->right)==-1) return -1;
return abs(getHight(node->left)-getHight(node->right))>1? -1:1+max(getHight(node->left),getHight(node->right));
}
bool isBalanced(TreeNode* root) {
return getHight(root)==-1? false:true;
}
代码随想录 跟随笔记 平衡二叉树
最新推荐文章于 2024-08-09 20:36:57 发布