make code more concise

fishercoder1534 · fishercoder1534 · commit efb79ed49909 · 2016-08-11T13:50:18.000-07:00
diff --git a/MEDIUM/src/medium/BinaryTreeRightSideView.java b/MEDIUM/src/medium/BinaryTreeRightSideView.java
@@ -35,14 +35,12 @@ public List<Integer> rightSideView(TreeNode root) {
 		while(!q.isEmpty()){
 			int currentSize = q.size();
 			int i = 0;
-			for(; i < currentSize-1; i++){
-				TreeNode currentNode = q.poll();
+			TreeNode currentNode = null;
+			for(; i < currentSize; i++){
+				currentNode = q.poll();
 				if(currentNode.left != null) q.offer(currentNode.left);
 				if(currentNode.right != null) q.offer(currentNode.right);
 			}
-			TreeNode currentNode = q.poll();
-			if(currentNode.left != null) q.offer(currentNode.left);
-			if(currentNode.right != null) q.offer(currentNode.right);
 			res.add(currentNode.val);
 		}
 		return res;
