Total Accepted: 13112 Total Submissions: 41069
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 {
public boolean isBalanced(TreeNode root) {
if (root == null) return true;
if (Math.abs(getLevel(root.left) - getLevel(root.right)) > 1) return false;
return isBalanced(root.left) && isBalanced(root.right);
}
public int getLevel(TreeNode root) {
if (root == null) return 0;
int l = getLevel(root.left) ;
int r = getLevel(root.right);
return l > r ? (l+1) : (r+1);
}
}