solves balanced binary tree

Author: anishLearnsToCode

README.md

@@ -37,7 +37,7 @@
 | 104 | [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](https://github.com/anishLearnsToCode/leetcode-algorithms/blob/master/src/MaximumDepthOfBinaryTree.java) |
 | 107 | [Binary Tree Level Order Traversal II](https://leetcode.com/problems/binary-tree-level-order-traversal-ii) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](https://github.com/anishLearnsToCode/leetcode-algorithms/blob/master/src/BinaryTreeLevelOrderTraversalII.java) |
 | 108 | [Convert Sorted Array To Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](https://github.com/anishLearnsToCode/leetcode-algorithms/blob/master/src/ConvertSortedArrayToBinarySearchTree.java) |
-| 110 | [Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree) | Easy |
+| 110 | [Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)]() | 
 | 111 | [Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree) | Easy |
 | 112 | [Path Sum](https://leetcode.com/problems/path-sum) | Easy |
 | 118 | [Pascal's Triangle](https://leetcode.com/problems/pascals-triangle) | Easy |

src/BalancedBinaryTree.java

@@ -0,0 +1,25 @@
+public class BalancedBinaryTree {
+    private static class TreeNode {
+        int val;
+        TreeNode left;
+        TreeNode right;
+    }
+
+    public static boolean isBalanced(TreeNode root) {
+        return height(root) != -1;
+    }
+
+    private static int height(TreeNode root) {
+        if (root == null) {
+            return 0;
+        }
+
+        int leftDepth = height(root.left);
+        int rightDepth = height(root.right);
+        if (leftDepth == -1 || rightDepth == -1 || Math.abs(rightDepth - leftDepth) > 1) {
+            return -1;
+        }
+
+        return 1 + Math.max(leftDepth, rightDepth);
+    }
+}