Right Side View
Intermediate
Imagine standing on the right side of the tree. Return the value of the node you can see at each level, from top to bottom (the rightmost node of each level).
The tests write a tree as a level-order list (row by row, left to right) with None for a missing child: [3, 9, 20, None, None, 15, 7] is a root 3 with children 9 and 20, where 20 has children 15 and 7.
For [1, 2, 3, None, 5, None, 4] the answer is [1, 3, 4].
Examples
Example 1
Input:
right_side_view(root) # root = [1, 2, 3, None, 5, None, 4]
Output:
[1, 3, 4]
Example 2
Input:
right_side_view(root) # root = [1, None, 3]
Output:
[1, 3]
Constraints
0 <= number of nodes <= 100000-10**9 <= val <= 10**9
Theory
Go to TheoryKeywords
dsa-sheetbinary-treestraversals
Run your code to see results
No results yet
Run your code to check it against the examples, or submit to run every test.