Shortest Path in a Fibonacci Tree

databricks

Problem: Shortest Path in a 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 subtrees:
    • the ...

Example

Unlock to view complete problem details

and practice with sample input/output

Was this article helpful?

View Test Cases & Run Code requires membership

Standard Input
Execution Result: