LeetCode103——Binary Tree Zigzag Level Order Traversal

题目链接

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

代码

class Solution:
    def zigzagLevelOrder(self, root: TreeNode) -> List[List[int]]:
        if root == None:
            return []
        res = []
        oneLayerNodes = [root]
        layNums = 1
        while len(oneLayerNodes) > 0:
            temp_layernodes = []
            oneLayerValue = []
            for node in oneLayerNodes:
                if layNums % 2 != 0:
                    if node.left != None:
                        temp_layernodes.append(node.left)
                    if node.right != None:
                        temp_layernodes.append(node.right)
                else:
                    if node.right != None:
                        temp_layernodes.append(node.right)
                    if node.left != None:
                        temp_layernodes.append(node.left)
                oneLayerValue.append(node.val)
            res.append(oneLayerValue)
            temp_layernodes.reverse()
            oneLayerNodes = list(temp_layernodes)
            layNums += 1
        return res

运行结果

Runtime: 44 ms, faster than 32.40% of Python3 online submissions for Binary Tree Zigzag Level Order Traversal.
Memory Usage: 13.1 MB, less than 5.36% of Python3 online submissions for Binary Tree Zigzag Level Order Traversal.

这个程序有一个问题，就是如果我把这两个句

temp_layernodes.reverse()
oneLayerNodes = list(temp_layernodes)

合并成一句话的话

oneLayerNodes = list(temp_layernodes.reverse())

这个程序就会报错，我感觉是因为list的reverse方法的参数是NA，没有返回值，因此，不能用list()的方式重新将一个列表深拷贝给另一个列表。