【leetcode每日刷题】110. Balanced Binary Tree

平衡二叉树

1271113FavoriteShare

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.

//Definition for a binary tree node.
public class TreeNode {
    int val;
    TreeNode left;
    TreeNode right;
    TreeNode(int x) { val = x; }
 }
class Solution {
    boolean isbalanced = true;
    public boolean isBalanced(TreeNode root) {
        getDepth(root);
        return isbalanced;
    }
    public int getDepth(TreeNode root){
        if(root == null) return 0;
        int left = getDepth(root.left);
        int right = getDepth(root.right);
        if(Math.abs(left - right) > 1){
            isbalanced = false;
        }
        return right > left? right+1 : left+1;
    }
}

平衡二叉树：左子树和右子树的高度差不能大于1

采用递归的策略，从后往前遍历树，并判断左子树和右子树的高度差，如果大于1，则返回false。