LeetCode題解：Balanced Binary Tree_leetcode

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.

題意：判斷左右子樹高度差是否大於1

解決思路：……

代碼：

public class Solution {    public boolean isBalanced(TreeNode root) {        if(root == null){            return true;        }        if(Math.abs(depth(root.left) - depth(root.right)) > 1){            return false;        }        return isBalanced(root.left) && isBalanced(root.right);    }    private int depth(TreeNode root){        if(root == null){            return 0;        }        return Math.max(depth(root.left), depth(root.right)) + 1;    }}