Recursion vs Iteration | Dataford Interview Questions

What is recursion, and how is it different from iterative constructs?

Demonstrate the distinction by implementing preorder traversal of a binary tree using both recursion and an explicit stack. traverse_tree(root) accepts None or a nested list [value, left, right] and returns a dictionary containing both traversal results. Values are integers, and the tree contains at most 1,000 nodes.

Constraints

root is null or a valid nested list in the form [value, left, right]
0 <= number of nodes <= 1000
Values are integers
Each node has at most one parent

Function Signature

def traverse_tree(root):

Your question is Recursion vs Iteration. 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

What is recursion, and how is it different from iterative constructs?

Constraints

root is null or a valid nested list in the form [value, left, right]
0 <= number of nodes <= 1000
Values are integers
Each node has at most one parent

Function Signature

def traverse_tree(root):

Your question is Recursion vs Iteration. 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.