# Binary Tree Right Side View: Walkthrough

Binary Tree Right Side View is a common tree question in coding rounds. Below is how I talk through it in an interview setting.

## Key idea

BFS keeps the last node in each level, or DFS right-first recording the first node seen at each depth.

## Steps to say out loud

1. Restate the input and output, and ask about empty trees and duplicate values.
2. Name the traversal (DFS or BFS) and what each call returns.
3. Code it, then trace a three-node example by hand.

## Complexity

O(n).

## Common mistake

Assuming the right side view is just the rightmost branch.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edge cases. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at https://linkjob.ai.