Find Path Between Nodes in a Fibonacci Tree

Given integers n, start, and end, find a path from the start node to the end node in a Fibonacci tree of order n, where the root value is always 0. Return the path as a sequence of directions (Up/Left/Right) in UURL format. A Fibonacci tree of order k has a root whose left subtree is a Fibonacci tree of order k-1 and right subtree is a Fibonacci tree of order k-2. Reference: https://stackoverflow.com/questions/76142856/finding-a-path-between-two-nodes-in-a-k-th-order-fibonacci-tree