LeetCode#103 二叉树的锯齿形层次遍历 Python（#102的变形）

这个题目是#102变了个输出形式而已，巩固一下

# 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]]:
        queue = collections.deque()
        res = []
        queue.append(root)
        level = 0
        while queue:
            tmp = []
            n = len(queue)
            for _ in range(n):
                cur = queue.popleft()
                if not cur:
                    continue
                tmp.append(cur.val)
                queue.append(cur.left)
                queue.append(cur.right)
            if tmp:
                if level % 2 == 0:
                    res.append(tmp)
                else:
                    res.append(tmp[::-1])
            level += 1
        return res