refactor 501

fishercoder1534 · fishercoder1534 · commit bc9c2a5e6729 · 2020-07-15T09:00:23.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_501.java b/src/main/java/com/fishercoder/solutions/_501.java
@@ -9,22 +9,6 @@
 import java.util.Map;
 import java.util.Queue;
 
-/**
- * 501. Find Mode in Binary Search Tree
- * Given a binary search tree with duplicates. You have to find all the mode(s) in given binary tree.
-
- For example:
- Given binary tree [1,null,2,2],
-  1
-   \
-   2
-  /
- 2
- return [2].
-
- Note: If a tree has more than one mode, you can return them in any order.
-
- */
 public class _501 {
 
     public static class Solution1 {
