Problem 39 of 75

Binary Tree Right Side View

MediumNot solved yetInterview me on this
Before you code · which pattern fits?

The problem

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

[1,2,3,null,5,null,4] → [1,3,4] [1,null,3] → [1,3]

Your solution runs against 3 unit tests, including edge and large-value cases.

Loading...

Test console · 3 unit tests

Submit your code to run it against all 3 unit tests. Results appear here.

JavaScript, TypeScript & Python run sandboxed in your browser; other languages run on the execution server. Your code is saved locally as you type.

Hint

Reference solution

Video explanation

Binary Tree Right Side View, explainedNeetCode