打卡群刷题总结0809——二叉树的锯齿形层次遍历

# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution(object):
    def zigzagLevelOrder(self, root):
        """
        :type root: TreeNode
        :rtype: List[List[int]]
        """
        if not root:
            return []
        flag = True
        nodes = [root]
        res = []
        while len(nodes) > 0:
            tmp = []
            ls = []
            for node in nodes:
                ls.append(node.val)
                if node.left:
                    tmp.append(node.left)
                if node.right:
                    tmp.append(node.right)
            
            nodes = tmp
            # print(ls)
            if flag:
                flag = False
            else:
                flag = True
                ls = ls[::-1]
            res.append(ls)
        return res