refactor 669

fishercoder1534 · fishercoder1534 · commit 2252a0eff4b8 · 2020-07-18T07:11:50.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_669.java b/src/main/java/com/fishercoder/solutions/_669.java
@@ -2,50 +2,6 @@
 
 import com.fishercoder.common.classes.TreeNode;
 
-/**
- * 669. Trim a Binary Search Tree
- *
- * Given a binary search tree and the lowest and highest boundaries as L and R,
- * trim the tree so that all its elements lies in [L, R] (R >= L).
- * You might need to change the root of the tree, so the result should return the new root of the trimmed binary search tree.
-
- Example 1:
-
- Input:
-   1
-  / \
- 0   2
-
- L = 1
- R = 2
-
- Output:
- 1
-  \
-  2
-
- Example 2:
-
- Input:
-  3
- / \
-0   4
- \
- 2
- /
-1
-
- L = 1
- R = 3
-
- Output:
-    3
-   /
-  2
- /
-1
-
- */
 public class _669 {
     public static class Solution1 {
         public TreeNode trimBST(TreeNode root, int L, int R) {
