How should I practice Binary Tree Right Side View?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Google phone screen and onsite interview problems in FastPrep.

Is Binary Tree Right Side View associated with Google?

FastPrep tags this as a Google phone screen and onsite interview coding practice problem when the problem catalog has that company and stage context.

Binary Tree Right Side View

Google● MediumNEW GRADINTERNPHONE SCREENONSITE INTERVIEW

Problem statement

Given the root of a binary tree, imagine standing to the right of it. Return the value of the node visible at each depth, ordered from the root level downward.

The problem statement continues

Pro

Examples

Example 1

root = [1,2,3,null,5,null,4]return = [1,3,4]

The rightmost values at depths zero, one, and two are 1, 3, and 4.

FastPrep Pro

Reported in 1 Google interview this week

Unlock this recently reported problem

FastPrep Pro gives you full access to interview problems reported within the last week.

Full problem statement and constraints
2 more worked examples, explained
Guided hints and editorial
Run your code on real test cases

$8.25/month

$99 billed yearly — or $19 month-to-month. Cancel anytime.

Free plan — 2 of 2 free unlocks used this week

See Google hiring insights