add test for 110

Author: fishercoder1534

src/main/java/com/fishercoder/solutions/_110.java

@@ -6,7 +6,8 @@
  * 110. Balanced Binary Tree
  *
  * Given a binary tree, determine if it is height-balanced.
- * 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 never differ by more than 1.
+ * 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 never differ by more than 1.
 
  Example 1:
  Given the following tree [3,9,20,null,null,15,7]:

src/test/java/com/fishercoder/_110Test.java

@@ -0,0 +1,49 @@
+package com.fishercoder;
+
+import com.fishercoder.common.classes.TreeNode;
+import com.fishercoder.common.utils.TreeUtils;
+import com.fishercoder.solutions._110;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import java.util.Arrays;
+
+import static org.junit.Assert.assertEquals;
+
+public class _110Test {
+    private static _110.Solution1 solution1;
+    private static _110.Solution2 solution2;
+    private static TreeNode treeNode;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _110.Solution1();
+        solution2 = new _110.Solution2();
+    }
+
+    @Test
+    public void test1() {
+        treeNode = TreeUtils.constructBinaryTree(Arrays.asList(3, 9, 20, null, null, 15, 7));
+        assertEquals(true, solution1.isBalanced(treeNode));
+    }
+
+    @Test
+    public void test2() {
+        treeNode = TreeUtils.constructBinaryTree(Arrays.asList(3, 9, 20, null, null, 15, 7));
+        assertEquals(true, solution2.isBalanced(treeNode));
+    }
+
+    @Test
+    public void test3() {
+        treeNode = TreeUtils.constructBinaryTree(Arrays.asList(1, 2, 2, 3, 3, null, null, 4, 4));
+        assertEquals(false, solution1.isBalanced(treeNode));
+    }
+
+    @Test
+    public void test4() {
+        treeNode = TreeUtils.constructBinaryTree(Arrays.asList(1, 2, 2, 3, 3, null, null, 4, 4));
+        assertEquals(false, solution2.isBalanced(treeNode));
+    }
+
+
+}