【题目】
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]
.
题意:给定一棵二叉树,返回从右边看这棵二叉树所看到的节点序列(从上到下)。
思路:层次遍历法。遍历到每层最后一个节点时,把其放到结果集中。
【Java代码】
public class Solution {
public List<Integer> rightSideView(TreeNode root) {
List<Integer> ans = new ArrayList<Integer>();
if (root == null) return ans;
LinkedList<TreeNode> queue = new LinkedList<TreeNode>();
queue.add(root);
queue.add(null);
while (!queue.isEmpty()) {
TreeNode node = queue.pollFirst();
if (node == null) {
if (queue.isEmpty()) {
break;
} else {
queue.add(null);
}
} else {
// add the rightest to the answer
if (queue.peek() == null) {
ans.add(node.val);
}
if (node.left != null) {
queue.add(node.left);
}
if (node.right != null) {
queue.add(node.right);
}
}
}
return ans;
}
}