题目链接:https://leetcode-cn.com/problems/binary-tree-right-side-view/
题目如下:
注:有几种情况,在考虑思路时,可能会没想到的
/**
* 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 {
public List<Integer> rightSideView(TreeNode root) {
List<Integer> result=new ArrayList<Integer>();
if(root==null) return result;
//思路:继续传统的层次遍历,对于每一行得到的元素,只取最右边一个即可
Queue<TreeNode> queue=new LinkedList<TreeNode>();
queue.offer(root);
while(!queue.isEmpty())
{
//ArrayList要得到数据,需先知道它的位置
//LinkedList可以直接拿到收尾位置,因为是链表
LinkedList<Integer> temp=new LinkedList<Integer>();
int size=queue.size();
while(size--!=0)
{
TreeNode node=queue.poll();
temp.add(node.val);
if(node.left!=null) queue.offer(node.left);
if(node.right!=null) queue.offer(node.right);;
}
result.add(temp.getLast());
}
return result;
}
}