|
sp; :return:
"""
if tree == None:
return
lst = []
node = tree
while node != None or len(lst) > 0:
if node != None:
lst.append(node)
node = node.left
else:
item = lst[len(lst)-1]
lst = lst[:-1]
print(item.value, end=' ')
node = item.right
def postOrder(self, tree):
"""
后序遍历
:param tree:
:return:
"""
if tree == None:
return None
self.postOrder(tree.left)
self.postOrder(tree.right)
print(tree.value, end=' ')
def postOrderLoop(self, tree):
"""
后续遍历的循环实现
:param tree:
:return:
"""
if tree == None:
return None
visited = set()
lst = []
node = tree
while node != None or len(lst) > 0:
if node != None:
lst.append(node)
node = node.left
else:
item = lst[len(lst)-1]
if item.right != None and item.right not in visited:
node = item.right
else:
print(item.value, end=' ')
visited.add(item)
lst = lst[:-1]
|