2096. Step-By-Step Directions From a Binary Tree Node to Another
2096. Step-By-Step Directions From a Binary Tree Node to Another
Description
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
.