Binary Tree Traversal | Dataford Interview Questions

Given a binary tree, implement a function to perform a specific traversal or transformation.

For this task, return the tree's zigzag level-order traversal. Represent each node as a dictionary with val, left, and right keys, where missing children are null. Return a list of levels, alternating traversal direction from left to right and right to left.

Constraints

0 <= number of nodes <= 10^4
Each node value is an integer
The input is a valid binary tree
Return one list for each tree level

Function Signature

def zigzag_level_order(root):

Your question is Binary Tree Traversal. 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, implement a function to perform a specific traversal or transformation.

Constraints

0 <= number of nodes <= 10^4
Each node value is an integer
The input is a valid binary tree
Return one list for each tree level

Function Signature

def zigzag_level_order(root):

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