Binary Tree Traversals Coding | Dataford Interview Questions

Write a function to traverse a binary tree in preorder, inorder, and postorder.

Use the signature def traverse_tree(root):. For grading, represent each node as [value, left_subtree, right_subtree], where a subtree is another nested list or None. Return a dictionary with keys preorder, inorder, and postorder, each containing a list of visited values. Preserve duplicate values and return empty lists when root is None.

Constraints

0 <= number of nodes <= 10^4
Each node is represented as [value, left_subtree, right_subtree]
Node values are integers
A missing subtree is represented by None

Function Signature

def traverse_tree(root):

Your question is Binary Tree Traversals Coding. 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

Write a function to traverse a binary tree in preorder, inorder, and postorder.

Constraints

0 <= number of nodes <= 10^4
Each node is represented as [value, left_subtree, right_subtree]
Node values are integers
A missing subtree is represented by None

Function Signature

def traverse_tree(root):

Your question is Binary Tree Traversals Coding. 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.