先用python的类表示二叉树的节点:
class Node(object):
def __init__(self, root=None, ltree=None, rtree=None):
self.root = root
self.ltree = ltree
self.rtree = rtree
访问树的所有结点,有且仅访问一次。按照根节点位置的不同分为前序遍历,中序遍历,后序遍历。
前序遍历:根节点->左子树->右子树
中序遍历:左子树->根节点->右子树
后序遍历:左子树->右子树->根节点
不同的遍历方式分别对应的python函数实现为:
def pretraverse(tree):
if tree == None:
return
print(tree.root, end='')
pretraverse(tree.ltree)
pretraverse(tree.rtree)
def midtraverse(tree):
if tree == None:
return
midtraverse(tree.ltree)
print(tree.root, end='')
midtraverse(tree.rtree)
def aftertraverse(tree):
if tree == None:
return
aftertraverse(tree.ltree)
aftertraverse(tree.rtree)
print(tree.root, end='')
有个二叉树举例如下:
输出结果为:
if __name__ == '__main__':
tree = Node('a', Node('b', Node('d', rtree=Node('e')), Node('f', ltree=Node('g'))), Node('c'))
pretraverse(tree)
print('\n')
midtraverse(tree)
print('\n')
aftertraverse(tree)
abdefgc
debgfac
edgfbca