Shortest Path in a Preorder-Labeled Fibonacci Tree

Problem: Shortest Path in a Preorder-Labeled Fibonacci Tree

Define a Fibonacci Tree T(n) as follows:

• T(0) and T(1) are both single-node trees.
• For n >= 2, the root of T(n) has two c...