即從樹的root開始,從上到下從從左到右周遊整個樹的節點
代碼實作:
def breadth_travel(self):
"""利⽤隊列實作樹的層次周遊"""
if root == None:
return
queue = []
queue.append(root)
while queue:
node = queue.pop(0)
print(node.elem)
if node.lchild is not None:
queue.append(node.lchild)
if node.rchild != None:
queue.append(node.rchild)