class TreeNode:
def __init__(self, x):
self.val = x
self.left = None
self.right = None
s=TreeNode(3);s.left=TreeNode(4);s.right=TreeNode(5);s.left.left=TreeNode(1);s.left.right=TreeNode(2);
#output1: 3,4,5,1,2
def printree(root):
if not root:
return []
curLayer=[root]
res=[]
while curLayer:
nextLayer=[]
for node in curLayer:
res.append(node.val)
if node.left:
nextLayer.append(node.left)
if node.right:
nextLayer.append(node.right)
curLayer=nextLayer
return res
res=printree(s)
print(','.join(str(i) for i in res))
#output2: [3],[4,5],[1,2]
def printree(root):
if not root:
return []
curLayer=[root]
res=[]
while curLayer:
nextLayer
按层打印二叉树
最新推荐文章于 2022-02-23 15:37:42 发布