refactor 145

Author: fishercoder1534

src/test/java/com/fishercoder/_145Test.java

@@ -1,6 +1,8 @@
 package com.fishercoder;
 
 import com.fishercoder.common.classes.TreeNode;
+import com.fishercoder.common.utils.CommonUtils;
+import com.fishercoder.common.utils.TreeUtils;
 import com.fishercoder.solutions._145;
 import org.junit.BeforeClass;
 import org.junit.Test;
@@ -12,24 +14,25 @@
 import static org.junit.Assert.assertEquals;
 
 public class _145Test {
-  private static _145.Solution1 solution1;
-  private static _145.Solution2 solution2;
-  private static TreeNode root;
-  private static List<Integer> expected;
+    private static _145.Solution1 solution1;
+    private static _145.Solution2 solution2;
+    private static TreeNode root;
+    private static List<Integer> expected;
 
-  @BeforeClass
-  public static void setup() {
-    solution1 = new _145.Solution1();
-    solution2 = new _145.Solution2();
-  }
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _145.Solution1();
+        solution2 = new _145.Solution2();
+    }
 
-  @Test
-  public void test1() {
-    root = new TreeNode(1);
-    root.left = new TreeNode(2);
-    root.right = new TreeNode(3);
-    expected = new ArrayList<>(Arrays.asList(2, 3, 1));
-    assertEquals(expected, solution1.postorderTraversal(root));
-    assertEquals(expected, solution2.postorderTraversal(root));
-  }
+    @Test
+    public void test1() {
+        root = TreeUtils.constructBinaryTree(Arrays.asList(1, 2, 3, 4, null, 5, 6, null, 7, null, null, null, null, 8, 9));
+        TreeUtils.printBinaryTree(root);
+        CommonUtils.printList(solution1.postorderTraversal(root));
+        CommonUtils.printList(solution2.postorderTraversal(root));
+        expected = new ArrayList<>(Arrays.asList(8, 9, 7, 4, 2, 5, 6, 3, 1));
+        assertEquals(expected, solution1.postorderTraversal(root));
+        assertEquals(expected, solution2.postorderTraversal(root));
+    }
 }