Binary Tree Traversals | Dataford Interview Questions

Given a binary tree, perform a depth-first traversal and return the values in preorder, inorder, and postorder.

Represent each node as [value, left, right], where left and right are either another encoded node or null. Implement tree_traversals(root) and return an object with preorder, inorder, and postorder arrays.

Constraints

The tree contains at most 500 nodes.
Each node is encoded as [value, left, right].
Node values are integers from -10^9 to 10^9.
A missing child is represented by null.

Function Signature

def tree_traversals(root):

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

Given a binary tree, perform a depth-first traversal and return the values in preorder, inorder, and postorder.

Constraints

The tree contains at most 500 nodes.
Each node is encoded as [value, left, right].
Node values are integers from -10^9 to 10^9.
A missing child is represented by null.

Function Signature

def tree_traversals(root):

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