"""实现二叉树功能"""
class Node(object):
"""节点类"""
def __init__(self, item):
# 初始化节点类,设置元素值,左,右指向的节点
self.elem = item
self.lchild = None
self.rchild = None
class Tree(object):
"""数类"""
def __init__(self):
# 初始化树的根节点
self.root = None
def add(self, item):
# 添加元素
node = Node(item)
# 判断树是不是为空
if self.root is None:
self.root = node
return
queue = [self.root]
while queue:
# 如果队列中元素取完了退出循环
cur_node = queue.pop(0)
if cur_node.lchild is None:
# 如果左边节点指向为空,则把节点添加在左节点
cur_node.lchild = node
return
else:
queue.append(cur_node.lchild)
if cur_node.rchild is None:
cur_node.rchild = node
return
else:
queue.append(cur_node.rchild)
def breadth_travel(self):
# 广度遍历
if self.root is None:
return
queue = [self.root]
while queue:
cur_node = queue.pop(0)
print(cur_node.elem, end=' ')
if cur_node.lchild is not None:
queue.append(cur_node.lchild)
if cur_node.rchild is not None:
queue.append(cur_node.rchild)
def preorder(self, node):
# 先序遍历
if node is None:
# 如果节点为空退出
return
print(node.elem, end=' ')
self.preorder(node.lchild)
self.preorder(node.rchild)
def inorder(self, node):
# 中序遍历
if node is None:
# 如果节点为空退出
return
self.inorder(node.lchild)
print(node.elem, end=' ')
self.inorder(node.rchild)
def postorder(self, node):
# 后续遍历
if node is None:
# 如果节点为空退出
return
self.postorder(node.lchild)
self.postorder(node.rchild)
print(node.elem, end=' ')
if __name__ == '__main__':
tree = Tree()
tree.add(0)
tree.add(1)
tree.add(2)
tree.add(3)
tree.add(4)
tree.add(5)
tree.add(6)
tree.add(7)
tree.add(8)
tree.breadth_travel()
print('')
tree.preorder(tree.root)
print('')
tree.inorder(tree.root)
print('')
tree.postorder(tree.root)
二叉树
最新推荐文章于 2022-05-01 12:47:37 发布