栈和队列_leetcode103

# 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 zigzagLevelOrder(self, root):
        """
        :type root: TreeNode
        :rtype: List[List[int]]
        """

        res = []

        if not root :
            return res

        queue = []
        queue.append(root)

        zFlag = True

        while queue:
            level = []
            for i in range(len(queue)):
                node = queue.pop(0)

                if zFlag:
                    level.append(node.val)
                else:
                    level.insert(0,node.val)

                if node.left:
                    queue.append(node.left)
                if node.right:
                    queue.append(node.right)

            res.append(level)
            zFlag = not zFlag

        return res

栈和队列_leetcode103

原文：https://www.cnblogs.com/lux-ace/p/10547340.html