@@ -0,0 +1,970 @@
+/**%0A * https://leetcode.com/problems/balanced-binary-tree/%0A * Given a binary tree, determine if it is height-balanced.%0A * 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 %0A * never differ by more than 1. %0A *%0A */%0A %0A/**%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 int deepth(TreeNode root) %7B%0A        if(root == null)%0A            return 0;%0A        if (root.left == null && root.right == null)%0A            return 1;%0A        return Math.max(deepth(root.left), deepth(root.right)) + 1;%0A    %7D%0A    public boolean isBalanced(TreeNode root) %7B%0A        if(root == null)%0A            return true;%0A        return isBalanced(root.left) && isBalanced(root.right) && (Math.abs(deepth(root.left) - deepth(root.right)) %3E 1 ? false : true);%0A    %7D%0A%7D%0A

Create 110_Balanced_Binary_Tree.java