← Amazon questions

Step-by-step directions from a binary tree node to another

Filed under Amazon

Given the root of a binary tree and values for a start node and target node, find the shortest path directions from start to destination using 'L', 'R', and 'U' (up).

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Amazon questions

Collected from public candidate posts and coding forums. Updated Nov 2026.