递归 自上而下:
c++
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
int height(TreeNode* root) {
if(root == nullptr){
return 0;
}else{
return max(height(root->left), height(root->right)) +1 ; // +1 加上根节点
}
}
bool isBalanced(TreeNode* root) {
if (root == nullptr){
return true;
}else{
return abs(height(root->left) - height(root->right)) <= 1 && isBalanced(root->left) && isBalanced(root->right);
//左右子树的高度差的绝对值不超过 1, 且左右树都是平衡树
}
}
};
python
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, val=0, left=None, right=None):
# self.val = val
# self.left = left
# self.right = right
class Solution:
def isBalanced(self, root: TreeNode) -> bool:
def height(root: TreeNode)-> int: # 函数返回值int类型
if not root:
return 0
else:
return max(height(root.left), height(root.right)) + 1
if not root:
return True
else:
return abs(height(root.left) - height(root.right)) <=1 and self.isBalanced(root.left) and self.isBalanced(root.right)
递归 自下而上:
c++
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
int height(TreeNode* root){
if (root == nullptr){
return 0;
}
int leftHeight = height(root->left);
int rightHeight = height(root->right);
if (leftHeight==-1 || rightHeight==-1 || abs(height(root->left) - height(root->right)) >1 ){
return -1;
}else{
return max(leftHeight, rightHeight) + 1;
}
}
bool isBalanced(TreeNode* root) {
return height(root) >= 0;
}
};