edit 501

fishercoder1534 · fishercoder1534 · commit b3fe9af5a5e8 · 2017-07-25T11:44:33.000-07:00
diff --git a/README.md b/README.md
@@ -117,7 +117,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |504|[Base 7](https://leetcode.com/problems/base-7/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_504.java) | O(1) |O(1) | Easy| 
 |503|[Next Greater Element II](https://leetcode.com/problems/next-greater-element-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/NextGreaterElementII.java) | O(n) |O(n) | Medium| Stack
 |502|[IPO](https://leetcode.com/problems/ipo/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_502.java) | O(nlogn) |O(n) | Hard| Heap, Greedy
-|501|[Find Mode in Binary Tree](https://leetcode.com/problems/find-mode-in-binary-tree/)|[Solution](../master/src/main/java/com/fishercoder/solutions/FindModeinBinaryTree.java) | O(n) |O(k) | Easy| Binary Tree
+|501|[Find Mode in Binary Tree](https://leetcode.com/problems/find-mode-in-binary-tree/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_501.java) | O(n) |O(k) | Easy| Binary Tree
 |500|[Keyboard Row](https://leetcode.com/problems/keyboard-row/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_500.java) | O(n) |O(1) | Easy|
 |499|[The Maze III](https://leetcode.com/problems/the-maze-iii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_499.java) | O(m*n) |O(m*n) | Hard| BFS
 |496|[Next Greater Element I](https://leetcode.com/problems/next-greater-element-i/)|[Solution](../master/src/main/java/com/fishercoder/solutions/NextGreaterElementI.java) | O(n*m) |O(1) | Easy|
diff --git a/src/main/java/com/fishercoder/solutions/_501.java b/src/main/java/com/fishercoder/solutions/_501.java
@@ -19,7 +19,7 @@ Given a binary search tree with duplicates. You have to find all the mode(s) in
  Note: If a tree has more than one mode, you can return them in any order.
 
  */
-public class FindModeinBinaryTree {
+public class _501 {
 
     public int[] findMode(TreeNode root) {
         int[] result = new int[]{};
diff --git a/src/test/java/com/fishercoder/_501Test.java b/src/test/java/com/fishercoder/_501Test.java
@@ -2,7 +2,7 @@
 
 import com.fishercoder.common.classes.TreeNode;
 import com.fishercoder.common.utils.CommonUtils;
-import com.fishercoder.solutions.FindModeinBinaryTree;
+import com.fishercoder.solutions._501;
 import org.junit.Before;
 import org.junit.BeforeClass;
 import org.junit.Test;
@@ -12,15 +12,15 @@
 /**
  * Created by fishercoder on 1/28/17.
  */
-public class FindModeinBinaryTreeTest {
-    private static FindModeinBinaryTree test;
+public class _501Test {
+    private static _501 test;
     private static int[] expected;
     private static int[] actual;
     private static TreeNode treeNode;
 
     @BeforeClass
     public static void setup(){
-        test = new FindModeinBinaryTree();
+        test = new _501();
     }
 
     @Before
