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 a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ /** * Definition for a binary tree node. * 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(getHeight(root.left,0)-getHeight(root.right,0)) > 1 ) { return false; } else return isBalanced(root.left) && isBalanced(root.right); } public int getHeight(TreeNode t,int current) { if(t == null) return current; return Math.max(getHeight(t.left, current+1),getHeight(t.right, current+1)); } } ~~~