Question
Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom.
For example:
Given the following binary tree,
1 <—
/ \
2 3 <—
\ \
5 4 <—
You should return [1, 3, 4].
https://leetcode.com/problems/binary-tree-right-side-view/
*Difficulty: Medium
Solution
BFS put the children from right to left, print the first child of the same layer
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public List<Integer> rightSideView(TreeNode root) {
List<Integer> list = new ArrayList<Integer>();
LinkedList<TreeNode> q = new LinkedList<>();
if(root != null)q.add(root);
while(q.size()>0){
int size = q.size(); //since size of q changed
for(int i = 0; i < size; i++){
TreeNode rightMost = q.poll();
if(i == 0) list.add(rightMost.val);
if(rightMost.right != null) q.add(rightMost.right);
if(rightMost.left != null) q.add(rightMost.left);
}
}
return list;
}
}