# @File : tree.py
# @Author: Wang Zhimin
# @Date : 2019/10/25
def Btree_create(btree,data,length):
for i in range(1,length):
level = 1
while btree[level]!=0:
if data[i]>btree[level]:
level=level*2+1 #如果数组值大于树根,就往右子树比较
else:
level=level*2 #如果数组值小于或等于树根,就往左子树比较
btree[level]=data[i] #把数组值放入二叉树
length=9
data=[0,6,3,5,4,7,8,9,2]#原始数组
btree=[0]*16
print("原始数组内容:")
for i in range(length):
print('[%2d]'%data[i],end='')
print('')
Btree_create(btree,data,9)
print('二叉树内容:')
for i in range(1,16):
print('[%2d]'%btree[i],end='')
print()
23.python 数据结构 用一维数组表示二叉树
最新推荐文章于 2024-07-28 17:42:24 发布