Step-By-Step Directions From a Binary Tree Node to Another

Problem Overview You receive the root node of a binary tree with n total nodes. Each node carries a distinct integer in the range from 1 through n. Two node values, startValue and destValue, are also supplied. Determine the minimum route from the node whose value is startValue to the node whose value is destValue, and express that route as a string. Represent each step with these characters: 'L': Go downward to the current node's left child. 'R': Go downward to the current…