Recursive Decision Path | Dataford Interview Questions

Implement a recursive algorithm to solve a multi-step decision path problem.

Represent the decision process as a tree. Each node is a dictionary with a decision value and a choices list of child nodes. Implement decision_paths(tree) to return every root-to-leaf path as a list of decision values. Preserve left-to-right child order. A single-node tree returns one path containing its decision.

Constraints

The tree contains at least one node.
Each node has a string decision value and a choices list.
A leaf node has an empty choices list.
Decision values may repeat at different nodes.
Return paths in left-to-right child order.

Function Signature

def decision_paths(tree):

Your question is Recursive Decision Path. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Implement a recursive algorithm to solve a multi-step decision path problem.

Constraints

The tree contains at least one node.
Each node has a string decision value and a choices list.
A leaf node has an empty choices list.
Decision values may repeat at different nodes.
Return paths in left-to-right child order.

Function Signature

def decision_paths(tree):

Your question is Recursive Decision Path. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.