leetcode之Binary Tree Level Order Traversal

这题就是一个广度搜索的题。需要一个队列来盛放相应层数上的所有字节点。代码如下：

# 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 levelOrder(self, root):
        """
        :type root: TreeNode
        :rtype: List[List[int]]
        """
        if root == None:
            return []
        a = [root]
        b = []
        c = []
        d = []
        while a != []:
            for i in range(len(a)):
                #可以用双向队列的leftpop来写
                last = a[0]
                del a[0]
                c.append(last.val)
                if last.left or last.right:
                    if last.left:
                        b.append(last.left)
                    if last.right:
                        b.append(last.right)
                else:
                    pass
            d.append(c)
            a = b[::]
            b = []
            c = []
        return d