103. Binary Tree Zigzag Level Order Traversal

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    def zigzagLevelOrder(self, root: TreeNode) -> List[List[int]]:
        if not root:
            return []
        nodelist = [root]
        result = []
        order = True
        while nodelist:
            tmplist = []
            vallist = []
            for node in nodelist:
                vallist.append(node.val)
                if node.left:
                    tmplist.append(node.left)
                if node.right:
                    tmplist.append(node.right)
            if not order:
                vallist.reverse()
            order = not order
            result.append(vallist)
            nodelist = tmplist
        return result