Practice Binary Tree Right Side View
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Medium#199
LeetCode ProblemBinary Tree Right Side View
Problem Statement
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.
Source: Binary Tree Right Side View on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
root = [1,2,3,null,5,null,4]
Output
[1,3,4]
# Example 2
Input
root = [1,2,3,4,null,null,null,5]
Output
[1,3,4,5]
# Example 3
Input
root = [1,null,3]
Output
[1,3]
# Example 4
Input
root = []
Output
[]
Constraints
The number of nodes in the tree is in the range [0, 100].
-100 <= Node.val <= 100
Related LeetCode Problems
Practice more problems similar to Binary Tree Right Side View.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.