Zigzag Binary Tree Printing | Dataford Interview Questions

How would you print a binary tree in zigzag manner?

Implement zigzag_level_order(root) using breadth-first traversal. The input is a nested dictionary with keys val, left, and right, or None; return a list of levels, alternating traversal direction from left to right and right to left.

The function should return an empty list for an empty tree and must not modify the input tree.

Constraints

0 <= number of nodes <= 1000
Each node contains an integer value
The input is a binary tree represented by nested dictionaries with keys val, left, and right
The input tree is not modified

Function Signature

def zigzag_level_order(root):

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

How would you print a binary tree in zigzag manner?

The function should return an empty list for an empty tree and must not modify the input tree.

Constraints

0 <= number of nodes <= 1000
Each node contains an integer value
The input is a binary tree represented by nested dictionaries with keys val, left, and right
The input tree is not modified

Function Signature

def zigzag_level_order(root):

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