@@ -0,0 +1,627 @@
+%0Apublic class _110BalancedBinaryTree %7B%0A    public boolean isBalanced(TreeNode root) %7B%0A        int height = treeHeight(root);%0A        return height == -1 ? false : true;%0A    %7D%0A    %0A    public int treeHeight(TreeNode root) %7B%0A    %09if (root == null) return 0;%0A    %09int leftHeight = treeHeight(root.left);%0A    %09int rightHeight  = treeHeight(root.right);%0A    %09if (leftHeight!= -1 && rightHeight != -1 && Math.abs(leftHeight - rightHeight) %3C= 1)%0A    %09%09return Math.max(leftHeight, rightHeight) + 1;%0A    %09else return -1;%0A    %7D%0A%09%0A%09public class TreeNode %7B%0A%09%09int val;%0A%09%09TreeNode left;%0A%09%09TreeNode right;%0A%09%09TreeNode(int x) %7B val = x; %7D%0A%09%7D%0A%7D%0A

Add 110 solution