edit 199

Author: fishercoder1534

README.md

@@ -366,6 +366,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |202|[Happy Number](https://leetcode.com/problems/happy-number/)|[Solution](../master/src/main/java/com/fishercoder/solutions/HappyNumber.java)| O(k)|O(k) | Easy
 |201|[Bitwise AND of Numbers Range](https://leetcode.com/problems/bitwise-and-of-numbers-range/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_201.java)| O(min(m,n))|O(1) | Medium | Bit Manipulation
 |200|[Number of Islands](https://leetcode.com/problems/number-of-islands/)|[Union Find](../master/src/main/java/com/fishercoder/solutions/_200UnionFind.java) [DFS](../master/MEDIUM/src/medium/_200DFS.java)| O(m*n)|O(m*n) | Medium| Union Find, DFS
+|199|[Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_199.java)| O(n)|O(n)| Medium | BFS 
 |198|[House Robber](https://leetcode.com/problems/house-robber/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_198.java)| O(n)|O(n)| Easy | DP
 |191|[Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_191.java)| O(n)|O(1)| Easy | Bit Manipulation
 |190|[Reverse Bits](https://leetcode.com/problems/reverse-bits/)|[Solution](../master/src/main/java/com/fishercoder/solutions/ReverseBits.java)| O(n)|O(1)| Easy | Bit Manipulation

src/main/java/com/fishercoder/solutions/BinaryTreeRightSideView.java src/main/java/com/fishercoder/solutions/_199.java

@@ -21,7 +21,8 @@
   5     4       <---
 
 You should return [1, 3, 4]. */
-public class BinaryTreeRightSideView {
+
+public class _199 {
 	//Using BFS is pretty straightforward. But there might be a smarter way.
 	public List<Integer> rightSideView(TreeNode root) {
 		List<Integer> res = new ArrayList<Integer>();
@@ -43,7 +44,7 @@ public List<Integer> rightSideView(TreeNode root) {
 	}
 
 	public static void main(String...strings){
-		BinaryTreeRightSideView test = new BinaryTreeRightSideView();
+		_199 test = new _199();
 		TreeNode root = new TreeNode(1);
 		root.left = new TreeNode(2);
 		root.right = new TreeNode(3);