Given the root of a binary tree, return its zigzag level-order traversal: left to right on the first level, right to left on the next, alternating each level.