Available question text
Given a binary tree and a target node, return the node immediately to the right of the target on the same depth (or null if none). This is typically solved with a level-order traversal (BFS) to locate the target within its level and return the next node in that level.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1602. Find Nearest Right Node in Binary Tree
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source