题目：
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.
题解：
采用递归的方法，要记录depth用来比较。
代码如下：
public class Solution { public boolean isBalanced(TreeNode root) { return maxDepth(root) != -1; } private int maxDepth(TreeNode root) { if (root == null) { return 0; } int left = maxDepth(root.left); int right = maxDepth(root.right); if (left == -1 || right == -1 || Math.abs(left-right) > 1) { return -1; } return Math.max(left, right) + 1; } }
转载于:https://www.cnblogs.com/hygeia/p/4714475.html
