一、题目
二、代码
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution
{
//队列 最右边即可
//不可 层序遍历更为合理
List<Integer> re = new LinkedList<>();
public List<Integer> rightSideView(TreeNode root)
{
if(root == null) return re;
Queue<TreeNode> que = new LinkedList<>();
que.offer(root);
re.add(root.val);
while(!que.isEmpty())
{
int i;
int length = que.size();
int temp_num = -101;
int flag = 0;
for(i=0;i<length;i++)
{
TreeNode temp = que.poll();
if(temp.left!=null)
{
que.offer(temp.left);
flag = 1;
temp_num = temp.left.val;
}
if(temp.right!=null)
{
que.offer(temp.right);
flag = 1;
temp_num = temp.right.val;
}
}
if(flag == 1) re.add(temp_num);
}
return re;
}
}