# coding:utf8 class Node(): def __init__(self, _item): self.item = _item self.left = None self.right = None class Tree(): def __init__(self): self.root = None def append(self, _item): node = Node(_item) cur = self.root point_list = [cur] # 如果添加的是根节点 if cur == None: self.root = node return while True: target_point = point_list.pop(0) if target_point.left == None: target_point.left = node return else: point_list.append(target_point.left) if target_point.right == None: target_point.right = node return else: point_list.append(target_point.right) # 广度优先搜索遍历 def travel(self): cur = self.root point_list = [cur] while point_list: target_point = point_list.pop(0) print(target_point.item) if target_point.left: point_list.append(target_point.left) if target_point.right: point_list.append(target_point.right) # 深度优先搜索遍历 def forward(self, root): # 前序遍历 ：根左右 if root == None: return print(root.item) self.forward(root.left) self.forward(root.right) def middle(self, root): # 中序遍历 ：左根右 if root == None: return self.middle(root.left) print(root.item) self.middle(root.right) def back(self, root): # 后序遍历 ：左右根 if root == None: return self.back(root.left) self.back(root.right) print(root.item) if __name__ == "__main__": tree = Tree() tree.append(1) tree.append(2) tree.append(3) tree.append(4) tree.append(5) tree.append(6) tree.append(7) # tree.travel() # tree.forward(tree.root) # tree.middle(tree.root) tree.back(tree.root)
版权声明：本文内容由互联网用户自发贡献，该文观点仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容， 请发送邮件至 举报，一经查实，本站将立刻删除。
文章由极客之家整理，本文链接：https://www.bmabk.com/index.php/post/187737.html
