Step-By-Step Directions From Binary Tree Node To Another
Find shortest path in binary tree from node s to t using DFS and LCA, returning step-by-step directions as string of 'L', 'R', and 'U' characters.
2096. Step-By-Step Directions From a Binary Tree Node to Another Medium You are given the root of a binary tree with n nodes. Each node is uniquely assigned a value from 1 to n. You are also given an integer startValue representing the value of the start node s, and a different integer destValue representing the value of the destination node t. Find the shortest path starting from node s and ending at node t. Generate step-by-step directions of such path as a string consisting of only the uppercase letters 'L', 'R', and 'U'. Each letter indicates a specific direction: 'L' means to go from a...