【剑指Offer】60.把二叉树打印成多行（Python实现）

题目描述

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

解法一：优先级队列法

# -*- 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 []
        tree = [pRoot]
        result = []
        while tree:
            subtree = []
            row = []
            for i in tree:
                row.append(i.val)
                if i.left:
                    subtree.append(i.left)
                if i.right:
                    subtree.append(i.right)
            result.append(row)
            tree = subtree
        return result