实现二叉树的 Python 程序
pythonserver side programmingprogramming更新于 2024/1/27 4:16:00
当需要在 Python 中实现二叉树时，使用面向对象方法。在这里，定义一个类，并定义属性。在类中定义执行某些操作的函数。创建该类的一个实例，并使用这些函数执行计算器操作。
下面是同样的演示 −
示例
class binomial_tree:
def __init__(self, key):
self.key = key
self.children = []
self.order = 0
def add_at_end(self, t):
self.children.append(t)
self.order = self.order + 1
my_tree = []
print('Menu')
print('create <key>')
print('combine <index1> <index2>')
print('exit')
while True:
option = input('What do you wish like to do? ').split()
operation = option[0].strip().lower()
if operation == 'create':
key = int(option[1])
b_tree = binomial_tree(key)
my_tree.append(b_tree)
print('Binomial tree has been created.')
elif operation == 'combine':
index_1 = int(option[1])
index_2 = int(option[2])
if my_tree[index_1].order == my_tree[index_2].order:
my_tree[index_1].add_at_end(my_tree[index_2])
del my_tree[index_2]
print('Binomial trees have been combined.')
else:
print('Order of trees need to be the same to combine them.')
elif operation == 'exit':
print("Exit")
break
print('{:>8}{:>12}{:>8}'.format('Index', 'Root key', 'Order'))
for index, t in enumerate(my_tree):
print('{:8d}{:12d}{:8d}'.format(index, t.key, t.order))
输出
Menu create <key> combine <index1> <index2> exit What do you wish like to do? create 7 Binomial tree has been created. Index Root key Order 0 7 0 What do you wish like to do? create 11 Binomial tree has been created. Index Root key Order 0 7 0 1 11 0 What do you wish like to do? create 4 Binomial tree has been created. Index Root key Order 0 7 0 1 11 0 2 4 0 What do you wish like to do? combine 0 1 Binomial trees have been combined. Index Root key Order 0 7 1 1 4 0 What do you wish like to do? exit Exit
解释
- 定义了一个名为"binomial_tree"的类。
- 它有一个方法可以将元素添加到树的末尾。
- 创建一个空列表。
- 根据选项，用户选择一个选项。
- 如果他们选择创建一个键，则创建一个类的实例，并创建一个二项式树。
- 还计算索引、根值和顺序。
- 如果需要组合索引，则选择另一个选项，并提及需要组合的节点的索引值。
- 这将组合数据并显示它。
