Preorder Traversal Code | Dataford Interview Questions

Write preorder traversal code.

Implement preorder_traversal(root), where root is a nested object with val, left, and right fields, or null. Return a list of values visited in root-left-right order. An empty tree must return an empty list.

Constraints

0 <= number of nodes <= 10^4
Each node contains a value and optional left and right child objects
Node values are integers
Return values in root-left-right order

Function Signature

def preorder_traversal(root):

Your question is Preorder Traversal Code. 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 preorder traversal code.

Constraints

0 <= number of nodes <= 10^4
Each node contains a value and optional left and right child objects
Node values are integers
Return values in root-left-right order

Function Signature

def preorder_traversal(root):

Your question is Preorder Traversal Code. 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.