Coding Challenge · INTERMEDIATE
Given the root of a binary tree, return the zigzag level order traversal of its nodes' values. In zigzag level order traversal, the nodes of each level are visited in alternating left-to-right and right-to-left order. The traversal starts from left to right for the first level, then right to left for the next level, an…