打印二叉树

import math

#  树的分析
origin = [30, 20, 80, 40, 50, 10, 60, 70, 90]
length = len(origin)  # 节点 9
h = math.ceil(math.log(length, 2))  # >3  所以深度为4
max_length = 2 ** (h - 1)  # 满二叉树的叶子数
index = 2 ** h - 1  # 总节点数 15
o = origin + [0] * (index - length)
new_list = len(o) * [0]

# 计算空格
for i in range(1, h + 1):
    times = 2 ** (i - 1)  # 每一层的个数
    index //= 2
    count = 1
    new_list = len(o) * [0]  # [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
    for j in range(times - 1, times * 2 - 1):
        if count > times*10:break
        if count % 2 != 0:
            new_list[index*count+(count-1)] = o[j]
            count += 1
        else:
            count += 1
            new_list[index*count+(count-1)] = o[j]
            count += 1
    # print(new_list)
    for i in new_list:
        print('  ', end='') if i == 0 else print(i,end='')
    print()

# 打印中间数
origin = [30, 20, 80, 40, 50, 10, 60, 70, 90]
length = len(origin)  # 节点 9
h = math.ceil(math.log(length, 2))  # >3  所以深度为4
index = 2 ** h - 1  # 满树的总节点数 15

for i in range(1,h+1):
    times = 2 ** (i - 1)
    for j in range(times - 1, times * 2 - 1):
        if j >= length: break
        # print(index)
        print('{:^{}}'.format(origin[j], index*2),end='**'*1)
    print()
    index //=  2