1.
public List<Integer> rightSideView(TreeNode root) {
List<Integer> res=new ArrayList<Integer>();
rightView(root,res,0);
return res;
}
public void rightView(TreeNode cur, List<Integer> res, int i) {
// TODO Auto-generated method stub
if(cur==null){
return;
}
if(i==res.size()){
res.add(cur.val);
}
rightView(cur.right, res, i+1);
rightView(cur.left, res, i+1);
}
2.
public List<Integer> rightSideView(TreeNode root) {
List<Integer> res=new ArrayList<Integer>();
if(root==null){
return res;
}
Queue<TreeNode> queue=new LinkedList<TreeNode>();
queue.offer(root);
while(!queue.isEmpty()){
int count=queue.size();
for(int i=0;i<count;i++){
TreeNode node=queue.poll();
if(i==count-1){
res.add(node.val);
}
if(node.left!=null){
queue.offer(node.left);
}
if(node.right!=null){
queue.offer(node.right);
}
}
}
return res;
}