Create 199-Binary-Tree-Right-Side-View.java

Author: SharmaTushar1

java/199-Binary-Tree-Right-Side-View.java

@@ -0,0 +1,23 @@
+class Solution {
+    public List<Integer> rightSideView(TreeNode root) {
+        List<Integer> list = new ArrayList<Integer>();
+        if (root == null) return list;
+        bfs(list, root);
+        return list;
+    }
+    
+    public void bfs(List<Integer> list, TreeNode root) {
+        Queue<TreeNode> q = new LinkedList<>();
+        q.offer(root);
+        while (!q.isEmpty()) {
+            int levelSize = q.size();
+            for (int i = 0; i<levelSize; i++) {
+                TreeNode cur = q.poll();
+                if (i==0) list.add(cur.val);
+                if (cur.right!=null) q.offer(cur.right);
+                if (cur.left!=null) q.offer(cur.left);
+            }
+        }
+    }
+    
+}