题解 | #把二叉树打印成多行#
把二叉树打印成多行
http://www.nowcoder.com/practice/445c44d982d04483b04a54f298796288
# -*- 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
que = []
queNext = []
ret = []
if pRoot:
que.append(pRoot)
while len(que) > 0:
retVal = []
for item in que:
retVal.append(item.val)
ret.append(retVal)
for item in que:
if item.left:
queNext.append(item.left)
if item.right:
queNext.append(item.right)
que = queNext
queNext = []
return ret
# 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
que = []
queNext = []
ret = []
if pRoot:
que.append(pRoot)
while len(que) > 0:
retVal = []
for item in que:
retVal.append(item.val)
ret.append(retVal)
for item in que:
if item.left:
queNext.append(item.left)
if item.right:
queNext.append(item.right)
que = queNext
queNext = []
return ret
