Leetcode 103. Binary Tree Zigzag Level Order Traversal

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

Medium

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]
]

---

• 类似BFS，一层层扩展。先从左到右把node放到list里，再判断是否需要反转。

# 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]]:
        if root is None:
            return []
        
        res = []
        cur = [root]
        from_right = False
        
        while cur:
            next_level, vals = [], []
            
            for node in cur:
                vals.append(node.val)
                
                if node.left:
                    next_level.append(node.left)

                if node.right:
                    next_level.append(node.right)
                    
            res.append(vals[::-1] if from_right else vals) # trick
            from_right = not from_right
            
            cur = next_level
        
        return res