把二叉树打印成多行 python

最新推荐文章于 2022-04-06 20:04:19 发布

酸乳酸乳

最新推荐文章于 2022-04-06 20:04:19 发布

阅读量147

点赞数

分类专栏：剑指offer

本文链接：https://blog.csdn.net/qq_41359265/article/details/84289254

版权

剑指offer 专栏收录该内容

20 篇文章 0 订阅

订阅专栏

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