[LeetCode] Binary Tree Right Side View solution report, leetcodebinary
[Question]
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 shoshould return[1, 3, 4].
[Resolution]
Given a binary tree, return the sequence of nodes (from top to bottom) seen by the binary tree on the right ).
Idea: hierarchical traversal. When traversing to the last node of each layer, place it in the result set.
[Java code]
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; }}