refactor 536

fishercoder1534 · fishercoder1534 · commit aaa2023c3666 · 2021-03-15T07:50:59.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_536.java b/src/main/java/com/fishercoder/solutions/_536.java
@@ -8,6 +8,9 @@
 public class _536 {
 
     public static class Solution1 {
+        /**
+         * recursive solution
+         */
         public TreeNode str2tree(String s) {
             if (s.equals("")) {
                 return null;
@@ -38,6 +41,9 @@ public TreeNode str2tree(String s) {
     }
 
     public static class Solution2 {
+        /**
+         * iterative solution
+         */
         public TreeNode str2tree(String s) {
             Deque<TreeNode> stack = new ArrayDeque<>();
             for (int i = 0, j = i; i < s.length(); i++, j = i) {
diff --git a/src/test/java/com/fishercoder/_536Test.java b/src/test/java/com/fishercoder/_536Test.java
@@ -23,10 +23,6 @@ public static void setup() {
         solution2 = new _536.Solution2();
     }
 
-    @Before
-    public void setupForEachTest() {
-    }
-
     @Test
     public void test1() {
         s = "4(2(3)(1))(6(5))";
@@ -42,4 +38,20 @@ public void test2() {
         assertEquals(expected, solution1.str2tree(s));
         assertEquals(expected, solution2.str2tree(s));
     }
+
+    @Test
+    public void test3() {
+        s = "-4(2(3)(1))(6(5)(7))";
+        expected = TreeUtils.constructBinaryTree(Arrays.asList(-4, 2, 6, 3, 1, 5, 7));
+        assertEquals(expected, solution1.str2tree(s));
+        assertEquals(expected, solution2.str2tree(s));
+    }
+
+    @Test
+    public void test4() {
+        s = "4";
+        expected = TreeUtils.constructBinaryTree(Arrays.asList(4));
+        assertEquals(expected, solution1.str2tree(s));
+        assertEquals(expected, solution2.str2tree(s));
+    }
 }
