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 class Solution {
public boolean isBalanced(TreeNode root) {
if(root == null) return true;
int left = getDepth(root.left);
int right = getDepth(root.right);
boolean isBalance = Math.abs(left-right)>1?false:true;
return isBalance&&isBalanced(root.left)&&isBalanced(root.right);
}
private int getDepth(TreeNode root){
if(root == null) return 0;
//if(root.left==null&&root.right==null) return 1;
int depth = 1;
int leftDepth = getDepth(root.left)+1;
int rightDepth = getDepth(root.right)+1;
return leftDepth>rightDepth?leftDepth:rightDepth;
}
}