refactor 199

Author: fishercoder1534

README.md

@@ -419,7 +419,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/_202.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/)|[Solution](../master/MEDIUM/src/medium/_200.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 
+|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(h)| 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/_190.java)| O(n)|O(1)| Easy | Bit Manipulation

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

@@ -33,7 +33,7 @@ public List<Integer> rightSideView(TreeNode root) {
 			int size = q.size();
 			for (int i = 0; i < size; i++) {
 				TreeNode curr = q.poll();
-				if (i == size-1) {
+				if (i == size - 1) {
 					result.add(curr.val);
 				}
 				if (curr.left != null) {
@@ -46,17 +46,5 @@ public List<Integer> rightSideView(TreeNode root) {
 		}
 		return result;
 	}
-	
-	public static void main(String...strings){
-		_199 test = new _199();
-		TreeNode root = new TreeNode(1);
-		root.left = new TreeNode(2);
-		root.right = new TreeNode(3);
-		root.left.right = new TreeNode(5);
-		root.right.right = new TreeNode(4);
-		List<Integer> result = test.rightSideView(root);
-		for(int i : result){
-			System.out.print(i + ", ");
-		}
-	}
-}
+
+}

src/test/java/com/fishercoder/_199Test.java

@@ -0,0 +1,28 @@
+package com.fishercoder;
+
+import com.fishercoder.common.classes.TreeNode;
+import com.fishercoder.common.utils.TreeUtils;
+import com.fishercoder.solutions._199;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import java.util.Arrays;
+
+import static org.junit.Assert.assertEquals;
+
+public class _199Test {
+    private static _199 test;
+    private static TreeNode root;
+
+    @BeforeClass
+    public static void setup() {
+        test = new _199();
+    }
+
+    @Test
+    public void test1() {
+        root = TreeUtils.constructBinaryTree(Arrays.asList(1, null, 3));
+        assertEquals(Arrays.asList(1, 3), test.rightSideView(root));
+    }
+
+}