| English | 简体中文 |
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).
Input: root = [3,9,20,null,null,15,7] Output: [,[20,9],[15,7]]
Input: root =  Output: []
Input: root =  Output: 
- The number of nodes in the tree is in the range
-100 <= Node.val <= 100