refactor 108

fishercoder1534 · fishercoder1534 · commit 5a9732847c0b · 2020-05-11T10:00:11.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_108.java b/src/main/java/com/fishercoder/solutions/_108.java
@@ -2,23 +2,6 @@
 
 import com.fishercoder.common.classes.TreeNode;
 
-/**
- * 108. Convert Sorted Array to Binary Search Tree
- *
- * Given an array where elements are sorted in ascending order, convert it to a height balanced BST.
- * For this problem, a height-balanced binary tree is defined as a binary tree in which
- * the depth of the two subtrees of every node never differ by more than 1.
- *
- * Example:
- * Given the sorted array: [-10,-3,0,5,9],
- * One possible answer is: [0,-3,9,-10,null,5], which represents the following height balanced BST:
- *
- *       0
- *     / \
- *   -3   9
- *   /   /
- * -10  5
- */
 public class _108 {
 
     public static class Solution1 {
