Given a binary tree, return its zigzag level order traversal. The zigzag level order traversal corresponds to traversing nodes from left to right for one level, and then right to left for the next level, and so on, reversing direction after every level.

Constraints:

• The number of nodes in the tree is in the range $0$ to $500$.

• $-100 \leq$ node.data $\leq 100$

Here’s a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.