二叉树层次遍历

class TreeNode(object):
     def __init__(self, x):
         self.val = x
         self.left = None
         self.right = None
class Solution(object):
    # 分层输出
    def levelorder_1(self, root):
        q = [[root]]
        for level in q:
            print(level)
            record = []
            for node in level:
                if node.left: record.append(node.left)
                if node.right: record.append(node.right)
            if record: q.append(record)
        res=[]
        for i in q:
            tem=[]
            for j in i:
                tem.append(j.val)
            res.append(tem)
        print(res)
        return res
    # 按顺序输出
    def levelorder_2(self, root):
        deque = [root]
        res=[]
        while deque:
            t=deque.pop(0)
            res.append(t.val)
            if t.left:
                deque.append(t.left)
            if t.right:
                deque.append(t.right)
        print(res)
        return res
if __name__ == '__main__':
    S = Solution()
    l1 = TreeNode(1)
    l2 = TreeNode(2)
    l3 = TreeNode(3)
    l4 = TreeNode(4)
    l5 = TreeNode(5)
    l6 = TreeNode(6)
    l7 = TreeNode(7)
    root = l1
    l1.left = l2
    l1.right = l3
    l2.left = l4
    l2.right = l5
    l3.left = l6
    l3.right = l7
    z = S.levelorder_2(root)

分别代表分层输出以及利用队列按顺序输出