剑指 Offer 32 - III. 从上到下打印二叉树 III

https://leetcode-cn.com/problems/cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof/
请实现一个函数按照之字形顺序打印二叉树，即第一行按照从左到右的顺序打印，第二层按照从右到左的顺序打印，第三行再按照从左到右的顺序打印，其他行以此类推。

思路：和https://blog.csdn.net/weixin_42219542/article/details/114650052?spm=1001.2014.3001.5501差不多，就是加了个level标志位，为偶数时，将当前层的value list进行reverse。

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

class Solution(object):
    def levelOrder(self, root):
        """
        :type root: TreeNode
        :rtype: List[List[int]]
        """
        result = list()
        if root is None:
            return result
        tree = list()
        tree.append(root)
        level = 0
        while len(tree) != 0:
            tmp = list()
            num = len(tree)
            for i in range(0, num):
                node = tree.pop(0)
                tmp.append(node.val)
                if node.left:
                    tree.append(node.left)
                if node.right:
                    tree.append(node.right)
            if level:
                tmp.reverse()
                result.append(tmp)
            else:
                result.append(tmp)
            level = 1 - level
        return result