[103] Binary Tree Zigzag Level Order Traversal

https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/description/

• algorithms
• Medium (39.19%)
• Source Code: 103.binary-tree-zigzag-level-order-traversal.py
• Total Accepted: 208.8K
• Total Submissions: 506.6K
• Testcase Example: '[3,9,20,null,null,15,7]'

Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level and alternate between).

For example: Given binary tree [3,9,20,null,null,15,7],

3

/
9 20 /
15 7

return its zigzag level order traversal as:

[ [3], [20,9], [15,7] ]

# 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]]
        """
        ret = []
        if not root: return ret
        queue = [root]
        left = True
        while queue:
            if left:
                ret.append([i.val for i in queue])
            else:
                ret.append([i.val for i in queue[::-1]])
            left = not left
            lenq = len(queue)
            for i in range(lenq):
                if queue[i].left:
                    queue.append(queue[i].left)
                if queue[i].right:
                    queue.append(queue[i].right)
            queue = queue[lenq:]
        return ret