题目 |
题目传送门:传送门(点击此处)
题解 |
思路
最简单的思路,层次遍历,直接贴上来,就好,每一层,拿到最右边的节点,就完事了,比较简单不做详细解释了,看代码吧!
code
class Solution {
public List<Integer> rightSideView(TreeNode root) {
List<Integer> res = new ArrayList<>();
Queue<TreeNode> queue = new LinkedList();
if (root == null) return res;
queue.add(root);
while (!queue.isEmpty()) {
int size = queue.size();
for (int i = 0; i < size; i++) {
TreeNode node = queue.poll();
if (i == size - 1) res.add(node.val);
if (node.left != null) queue.add(node.left);
if (node.right != null) queue.add(node.right);
}
}
return res;
}
}