Binary Tree Right Side View
Given the root of 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.
Example 1
1
/ \
2 3
\ \
5 4Input
root = [1,2,3,null,5,null,4]Output
[1,3,4]From the right side, the visible nodes from top to bottom are 1, 3, and 4.
Example 2
1
/ \
2 3
/
4
/
5Input
root = [1,2,3,4,null,null,null,5]Output
[1,3,4,5]From the right side, the visible nodes from top to bottom are 1, 3, 4, and 5.
Constraints
- The number of nodes in the tree is in the range
[0, 100]. -100 <= Node.val <= 100