Q60 把二叉树打印成多行

题目描述
从上到下按层打印二叉树，同一层结点从左至右输出。每一层输出一行。

# -*- coding:utf-8 -*-
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None
class Solution:
    # 返回二维列表[[1,2],[4,5]]
    def Print(self, pRoot):
        # write code here
        if not pRoot:
            return []
        current = [pRoot]
        next = []
        result = []
        while current:
            for i in current:
                if i.left:
                    next.append(i.left)
                if i.right:
                    next.append(i.right)
            result.append([i.val for i in current])
            current,next = next,[]
        return result