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.
/**
* Definition for binary tree
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
boolean flag = false;
public boolean isBalanced(TreeNode root) {
getDepth(root);
return !flag;
}
public int getDepth(TreeNode root) {
if(flag || root == null) {
return 0;
}
int left = getDepth(root.left);
int right = getDepth(root.right);
if(Math.max(left, right) - Math.min(left, right) > 1) {
flag = true;
}
return 1 + Math.max(left, right);
}
}