public List<Integer> rightSideView_bfs(TreeNode root){ List<Integer> ans = new ArrayList<>(); if (root == null) { return ans; }
Queue<TreeNode> queue = new LinkedList<>(); queue.offer(root); while (!queue.isEmpty()) { int size = queue.size(); for (int i = size - 1; i >= 0; i--) { TreeNode node = queue.poll(); if (i == size - 1) { ans.add(node.val); }
if (node.right != null) { queue.offer(node.right); }
if (node.left != null) { queue.offer(node.left); } } }
return ans; }
Analysis
Time Complexity: O(n).
Space Complexity: O(n).
All suggestions are welcome.
If you have any query or suggestion please comment below.
Please upvote👍 if you like💗 it. Thank you:-)