Problem
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). (link)
Example 1:
Input: root = [3,9,20,null,null,15,7]
O...
![[CS Fundamentals] DFS and BFS](https://cdn.hashnode.com/res/hashnode/image/upload/v1746937304620/0bfc6fdc-4edc-4475-b491-3405e5c30211.png)
