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.