Binary Tree and Zig-Zag Traversal | Dataford Interview Questions

Given a binary tree, write a function to print it in zig-zag traversal.

Return the traversal as a list of levels, alternating left-to-right and right-to-left order. The input root is either None or a nested dictionary with keys val, left, and right; child values use the same format.

Constraints

0 <= number of nodes <= 10^4
Each node contains an integer value
Each node has at most one left child and one right child
The input contains no cycles

Function Signature

def zigzag_traversal(root):

Your question is Binary Tree and Zig-Zag 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, write a function to print it in zig-zag traversal.

Constraints

0 <= number of nodes <= 10^4
Each node contains an integer value
Each node has at most one left child and one right child
The input contains no cycles

Function Signature

def zigzag_traversal(root):

Your question is Binary Tree and Zig-Zag 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.