← 返回 amazon 的题目列表Right Side View of Binary Tree Nodes
类型：online_judge
amazon
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.
Input:
root: The root node of the binary tree.
Output:
Return a list of node values seen from the right side view of the tree.
Example:
Input: [1,2,3,null,5,null,4]
Output: [1, 3, 4]
Explanation:
1 <---
/ \
2 3 <---
\ \
5 4 <---
Constraints:
The number of nodes in the tree is in the range [0, 100].
-100 <= Node.val <= 100.
Example
Input
[1,2,3,null,5,null,4]