#按层打印
def printByLevel(root):
if not root:
return
print("Print binary tree by level")
queue = []
queue.append(root)
last = root
level = 1
print("Level " + str(level) + ':', end=' ')
while queue:
root = queue.pop(0)
print(root.val, end=' ')
if root.left:
nlast = root.left
queue.append(root.left)
if root.right:
nlast = root.right
queue.append(root.right)
if root == last and queue:
last = nlast
print()
level += 1
print("Level " + str(level) + ":", end=' ')
层次遍历二叉树(python)
猜你喜欢
转载自blog.csdn.net/miner_zhu/article/details/81032682
今日推荐
周排行