Aphelios丶万千利器

摘要： 1 class BTree: 2 def __init__(self, value): 3 self.left = None 4 self.data = value # 节点值 5 self.right = None 6 7 def insertLeft(self, value): # 左子树插入节 阅读全文

摘要： 以列表方式构建如图的树： G = ['G', [] ] H = ['H', [] ] I = ['I', [] ] K = ['K', [] ] E = ['E',[G, H, I, K] ] # E节点 D = ['D', [] ] F = ['F', [] ] A = ['A', [D, E] 阅读全文