Binary Tree Right Side View

Asked byFacebookAmazonBloombergQualtricsOracleApple

Problem

Given the root of a binary tree, return the values of the nodes you would see if you stood on the right side of the tree, ordered from top to bottom.

Examples

Example 1

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

Output:[1,3,4]

Constraints

0 <= number of nodes <= 100

Solve it in the editor. Sign in free to run your Python or JavaScript against test cases, get a verdict, and track your attempts.

Solve on FeatCode →

How to approach it: the Trees pattern

A tree is a hierarchical structure where each node has at most a fixed number of children (two, for binary trees). Almost every tree problem reduces to a traversal — decide what order you visit nodes in, and what you do at each one.

Look for this pattern when

The problem is naturally recursive: "the answer for this tree depends on the answer for its subtrees."
You need level-by-level information (BFS) versus depth-first structural information (DFS).

Read the full Trees guide →

Video walkthroughs

Original problem on LeetCode ↗