- 题目描述
输入一棵二叉树的根节点,判断该树是不是平衡二叉树。如果某二叉树中任意节点的左右子树的深度相差不超过
1,那么它就是一棵平衡二叉树。
- 题解
递归求解即可
1. 时间O(nlogn),空间O(n)
2. 时间O(n),空间O(n)
- 代码
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
bool isBalanced(TreeNode* root) {
if (!root) return true;
return isBalanced(root->left)&&isBalanced(root->right)&&(abs(getHeight(root->left)-getHeight(root->right))<=1);
}
int getHeight(TreeNode* root){
if (!root) return 0;
int left_height=getHeight(root->left);
int right_height=getHeight(root->right);
return max(left_height,right_height)+1;
}
};
class Solution {
public:
bool isBalanced(TreeNode* root) {
if (!root) return true;
return getHeight(root)!=-1;
}
int getHeight(TreeNode* root){
if (!root) return 0;
int left_height=getHeight(root->left);
if (left_height==-1) return -1;
int right_height=getHeight(root->right);
if (right_height==-1) return -1;
if (abs(left_height-right_height)<=1) return max(left_height,right_height)+1;
return -1;
}
};
参考链接:https://leetcode-cn.com/problems/ping-heng-er-cha-shu-lcof/solution/mian-shi-ti-55-ii-ping-heng-er-cha-shu-cong-di-zhi/