【LeetCode】110. 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 depth of the two subtrees of every node never differ by 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。

/**
 * 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) {
        return dfsHeight(root) != -1;
    }
    int dfsHeight(TreeNode* root){
        if(root==NULL) return 0;
        
        int leftTree=dfsHeight(root->left);
        int rightTree=dfsHeight(root->right);
        if(leftTree==-1) return -1;
        if(rightTree==-1) return -1;
        
        if(abs(leftTree-rightTree)>1) return -1;
        return max(leftTree,rightTree)+1;
        
    }
};