Binary Tree Right Side View — Medium Coding Interview Question

Given the root of a binary tree, imagine standing on its right side. Return the values of the nodes visible from the right, ordered top to bottom.

Example

Input: root = [1,2,3,null,5,null,4]

Output: [1,3,4]

Constraints

• The number of nodes is in the range [0, 100]
• -100 ≤ Node.val ≤ 100

Topics & Companies

Topics: trees

Asked by: Amazon, Meta, Microsoft, Google

Optimal Solution Complexity

Time complexity: O(n). Space complexity: O(n).

Practice more

• All DSA Problems
• DSA Patterns