二叉树层次遍历

Binary Tree Level Order Traversal
Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level).

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

    3
   / \
  9  20
    /  \
   15   7

return its level order traversal as:

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

迭代方法：

class Solution:
    def levelOrder(self, root: TreeNode) -> List[List[int]]:
        if root is None:
            return []
        currentQueue=[root] 
        ret=[]
        while currentQueue:
            nextQueue=[]
            tmp = []
            for node in currentQueue:
                tmp.append(node.val)
                if node.left:
                    nextQueue.append(node.left)
                if node.right:
                    nextQueue.append(node.right)
            ret.append(tmp)
            currentQueue=nextQueue
        return ret