Leetcode 1602. Find Nearest Right Node in Binary Tree

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.