@@ -0,0 +1,699 @@
+/**%0A * Definition for binary tree%0A * public class TreeNode %7B%0A *     int val;%0A *     TreeNode left;%0A *     TreeNode right;%0A *     TreeNode(int x) %7B val = x; %7D%0A * %7D%0A */%0Apublic class Solution %7B%0A    public boolean isBalanced(TreeNode root) %7B%0A        if(getHeight(root) == -1) %7B%0A            return false;%0A        %7D%0A        %0A        return true;%0A    %7D%0A    %0A    private int getHeight(TreeNode root) %7B%0A        if (root == null) %7B%0A            return 0;%0A        %7D%0A        %0A        int left = getHeight(root.left);%0A        int right = getHeight(root.right);%0A        if (left == -1 %7C%7C right == -1 %7C%7C Math.abs(left-right) %3E 1) %7B%0A            return -1;%0A        %7D%0A        return Math.max(left, right) + 1;%0A    %7D%0A%7D%0A

Create Balanced_Binary_Tree.java