given a fibonacci tree of order K (fib(k) = fib(k-1) + fib(k-2) subtree structure), find path between 2 nodes. first i didnt even know what a fib tree was lol. interviewer explained. recursive DFS w path tracking. got it but slowly. probably tanked the round.

Databricks E4 - fib tree

given a fibonacci tree of order K (fib(k) = fib(k-1) + fib(k-2) subtree structure), find path between 2 nodes.