題目描述

# -*- 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 None
        queue = [pRoot]
        last = pRoot
        tmp, res = [], []
        while queue:
            node = queue.pop(0)
            tmp.append(node.val)
            if node.left:
                queue.append(node.left)
            if node.right:
                queue.append(node.right)
            if node == last:
                res.extend(tmp)
                tmp = []
                if queue: last = queue[-1]
        return res