refactor 230

fishercoder1534 · fishercoder1534 · commit 369fe1f18d98 · 2017-08-29T08:50:58.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_230.java b/src/main/java/com/fishercoder/solutions/_230.java
@@ -19,7 +19,7 @@ What if the BST is modified (insert/delete operations) often and you need to fin
  */
 public class _230 {
 
-    public static class MostNaiveWay {
+    public static class Solution1 {
         public int kthSmallest(TreeNode root, int k) {
             List<Integer> inorderList = new ArrayList<>();
             inorder(root, inorderList);
@@ -41,7 +41,10 @@ private void inorder(TreeNode root, List<Integer> inorderList) {
         }
     }
 
-    public static class BetterWay {
+    public static class Solution2 {
+        /**
+         * Inorder traversal gives the natural ordering of a BST, no need to sort.
+         */
         int count = 0;
         int result = Integer.MIN_VALUE;
 
diff --git a/src/test/java/com/fishercoder/_230Test.java b/src/test/java/com/fishercoder/_230Test.java
@@ -11,31 +11,31 @@
  * Created by fishercoder on 5/19/17.
  */
 public class _230Test {
-    private static _230.MostNaiveWay naiveWay;
-    private static _230.BetterWay betterWay;
+    private static _230.Solution1 solution1;
+    private static _230.Solution2 solution2;
     private static TreeNode root;
     private static int k;
 
     @BeforeClass
     public static void setup() {
-        naiveWay = new _230.MostNaiveWay();
-        betterWay = new _230.BetterWay();
+        solution1 = new _230.Solution1();
+        solution2 = new _230.Solution2();
     }
 
     @Test
     public void test1() {
         root = new TreeNode(1);
         k = 1;
-        assertEquals(1, naiveWay.kthSmallest(root, k));
-        assertEquals(1, betterWay.kthSmallest(root, k));
+        assertEquals(1, solution1.kthSmallest(root, k));
+        assertEquals(1, solution2.kthSmallest(root, k));
     }
 
     @Test
     public void test2() {
         root = new TreeNode(2);
         root.left = new TreeNode(1);
         k = 1;
-        assertEquals(1, naiveWay.kthSmallest(root, k));
-        assertEquals(1, betterWay.kthSmallest(root, k));
+        assertEquals(1, solution1.kthSmallest(root, k));
+        assertEquals(1, solution2.kthSmallest(root, k));
     }
 }
