# Binary Tree Zigzag Level Order Traversal: Explained

Binary Tree Zigzag Level Order Traversal is a common tree question in coding rounds. Below is how I talk through it in an interview setting.

## Key idea

Standard BFS by level, appending to a deque from the left or right depending on level parity.

## Steps to say out loud

1. Restate the input and output, and ask about empty trees and duplicate values.
2. Name the traversal (DFS or BFS) and what each call returns.
3. Code it, then trace a three-node example by hand.

## Complexity

O(n).

## Common mistake

Reversing child push order instead of output order breaks deeper levels.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edge cases. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at Linkjob.ai.