# Leetcode 103 - Binary tree zigzag level order traversal

Note:

• BFS traversal
• Use a bool to check level traversal direction.
• The only thing changes is the level list. Use push or unshift based on the bool.

Given the root of a binary tree, return the zigzag level order traversal of its nodes’ values. (i.e., from left to right, then right to left for the next level and alternate between).

Question:

Example:

Code: