edit 99

Author: fishercoder1534

README.md

@@ -429,7 +429,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |103|[Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_103.java)| O(n)|O(h) | Medium| BFS,DFS
 |102|[Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_102.java)| O(n)|O(h) | Medium| BFS
 |101|[Symmetric Tree](https://leetcode.com/problems/symmetric-tree/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_101.java)| O(n)|O(h) | Easy| DFS
-|99|[Recover Binary Search Tree](https://leetcode.com/problems/recover-binary-search-tree/)|[Solution](../master/src/main/java/com/fishercoder/solutions/RecoverBinarySearchTree.java) | O(?) | O(?) | Hard |
+|99|[Recover Binary Search Tree](https://leetcode.com/problems/recover-binary-search-tree/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_99.java) | O(?) | O(?) | Hard |
 |98|[Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_98.java) | O(n) | O(h) | Medium | DFS/Recursion
 |97|[Interleaving String](https://leetcode.com/problems/interleaving-string/)|[Solution](../master/src/main/java/com/fishercoder/solutions/InterleavingString.java)| O(?)|O(?) | Hard| DP
 |96|[Unique Binary Search Trees](https://leetcode.com/problems/unique-binary-search-trees/)|[Solution](../master/src/main/java/com/fishercoder/solutions/UniqueBinarySearchTrees.java) | O(n^2) | O(n) | Medium | Recursion, DP

…r/solutions/RecoverBinarySearchTree.java …/java/com/fishercoder/solutions/_99.javasrc/main/java/com/fishercoder/solutions/RecoverBinarySearchTree.java renamed to src/main/java/com/fishercoder/solutions/_99.java src/main/java/com/fishercoder/solutions/RecoverBinarySearchTree.java renamed to src/main/java/com/fishercoder/solutions/_99.java

@@ -7,7 +7,7 @@
 
  Note:
  A solution using O(n) space is pretty straight forward. Could you devise a constant space solution?*/
-public class RecoverBinarySearchTree {
+public class _99 {
 	TreeNode firstElement = null;
 	TreeNode secondElement = null;