refactor 108

Author: fishercoder1534

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

@@ -9,21 +9,20 @@
  */
 public class _108 {
 
-    public static class Solution1 {
-        public TreeNode sortedArrayToBST(int[] num) {
-            return rec(num, 0, num.length - 1);
-        }
-
-        public TreeNode rec(int[] num, int low, int high) {
-            if (low > high) {
-                return null;
-            }
-            int mid = low + (high - low) / 2;
-            TreeNode root = new TreeNode(num[mid]);
-            root.left = rec(num, low, mid - 1);
-            root.right = rec(num, mid + 1, high);
-            return root;
-        }
+  public static class Solution1 {
+    public TreeNode sortedArrayToBST(int[] num) {
+      return rec(num, 0, num.length - 1);
     }
 
+    public TreeNode rec(int[] num, int low, int high) {
+      if (low > high) {
+        return null;
+      }
+      int mid = low + (high - low) / 2;
+      TreeNode root = new TreeNode(num[mid]);
+      root.left = rec(num, low, mid - 1);
+      root.right = rec(num, mid + 1, high);
+      return root;
+    }
+  }
 }