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.
public boolean isBalanced(TreeNode root) {
if (root == null) return true;
if (getDep(root) == -1) {
return false;
}else {
return true;
}
}
private int getDep(TreeNode root){
if(root == null) return 0;
int leftDep = getDep(root.left);
int rightDep = getDep(root.right);
if(leftDep ==-1|| rightDep ==-1) return -1;
if (Math.abs(leftDep - rightDep) > 1) {
return -1;
}
return Math.max(leftDep, rightDep)+1;
}