【LeetCode】判断一颗树是不是平衡二叉树：Balanced Binary Tree

Given a binary tree, determine if it is height-balanced.

For this problem, a height-balanced binary tree is defined as:

a binary tree in which the left and right subtrees of every node differ in height by no more than 1.

Example 1:

Given the following tree [3,9,20,null,null,15,7]:

    3
   / \
  9  20
    /  \
   15   7

Return true.

Example 2:

Given the following tree [1,2,2,3,3,null,null,4,4]:

       1
      / \
     2   2
    / \
   3   3
  / \
 4   4

Return false.

解题思路：

• 求出当前结点的左右子树的深度，深度差超过1，非平衡二叉树；
• 如果深度差不超过1，继续递归遍历其左右子树，只有每一个结点的左右子树深度差都不超过1的树，才是平衡二叉树；

代码如下：

class Solution {
public:
    bool isBalanced(TreeNode* root) {
        if(!root) return true;
        
        int leftDepth = treeDepth(root->left);
        int rightDepth = treeDepth(root->right);
        
        if(abs(leftDepth - rightDepth) > 1)
            return false;
        
        return isBalanced(root->left) && isBalanced(root->right);
        
    }
    
    int treeDepth(TreeNode* root) {
        if(!root) return 0;
        
        int leftDepth = 1 + treeDepth(root->left);
        int rightDepth = 1 + treeDepth(root->right);
        
        return max(leftDepth, rightDepth);
    }
};