@@ -0,0 +1,663 @@
+/**%0A * Definition for a binary tree node.%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(root == null) return true;%0A        if(height(root) == -1) return false;%0A        return true;%0A    %7D%0A    %0A    private int height(TreeNode root) %7B%0A        if(root == null) return 0;%0A        int left = height(root.left);%0A        int right = height(root.right);%0A        if(left == -1 %7C%7C right == -1) return -1;%0A        if(Math.abs(left - right) %3E 1) return -1;%0A        return Math.max(left, right) + 1;%0A    %7D%0A%7D%0A

Create Balanced_Binary_Tree.java