refactor 538

fishercoder1534 · fishercoder1534 · commit 9ac4c9152468 · 2019-06-17T08:13:25.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_538.java b/src/main/java/com/fishercoder/solutions/_538.java
@@ -28,7 +28,7 @@
 
 public class _538 {
 
-    public static class BSTSolution {
+    public static class Solution1 {
         /**
          * Traverse in this order: right -> root -> left
          */
@@ -46,7 +46,7 @@ private int dfs(TreeNode root, int val) {
         }
     }
 
-    public static class GenericSolution {
+    public static class Solution2 {
         //This solution is generic for both BST and regular binary trees
         public TreeNode convertBST(TreeNode root) {
             if (root == null) {
diff --git a/src/test/java/com/fishercoder/_538Test.java b/src/test/java/com/fishercoder/_538Test.java
@@ -9,15 +9,15 @@
 import static junit.framework.Assert.assertEquals;
 
 public class _538Test {
-    private static _538.GenericSolution genericSolution;
-    private static _538.BSTSolution bstSolution;
+    private static _538.Solution2 solution2;
+    private static _538.Solution1 solution1;
     private static TreeNode expectedRoot;
     private static TreeNode root;
 
     @BeforeClass
     public static void setup() {
-        bstSolution = new _538.BSTSolution();
-        genericSolution = new _538.GenericSolution();
+        solution1 = new _538.Solution1();
+        solution2 = new _538.Solution2();
     }
 
     @Before
@@ -32,15 +32,15 @@ public void test1() {
         expectedRoot = new TreeNode(18);
         expectedRoot.left = new TreeNode(20);
         expectedRoot.right = new TreeNode(13);
-        assertEquals(expectedRoot.toString(), genericSolution.convertBST(root).toString());
-        assertEquals(expectedRoot.toString(), bstSolution.convertBST(root).toString());
+        assertEquals(expectedRoot.toString(), solution2.convertBST(root).toString());
+        assertEquals(expectedRoot.toString(), solution1.convertBST(root).toString());
     }
 
     @Test
     public void test2() {
         root = null;
         expectedRoot = null;
-        assertEquals(expectedRoot, genericSolution.convertBST(root));
-        assertEquals(expectedRoot, bstSolution.convertBST(root));
+        assertEquals(expectedRoot, solution2.convertBST(root));
+        assertEquals(expectedRoot, solution1.convertBST(root));
     }
 }

Original file line number	Diff line number	Diff line change
`@@ -28,7 +28,7 @@`
`28`	`28`
`29`	`29`	`public class _538 {`
`30`	`30`
`31`		`- public static class BSTSolution {`
	`31`	`+ public static class Solution1 {`
`32`	`32`	`/**`
`33`	`33`	`* Traverse in this order: right -> root -> left`
`34`	`34`	`*/`
`@@ -46,7 +46,7 @@ private int dfs(TreeNode root, int val) {`
`46`	`46`	`}`
`47`	`47`	`}`
`48`	`48`
`49`		`- public static class GenericSolution {`
	`49`	`+ public static class Solution2 {`
`50`	`50`	`//This solution is generic for both BST and regular binary trees`
`51`	`51`	`public TreeNode convertBST(TreeNode root) {`
`52`	`52`	`if (root == null) {`