1 使用列表的形式构建树
#使用list构建树
G = ['G',[]]
H=['H',[]]
I=['I',[]]
K=['K',[]]
E=['E',[G,H,I,K]]
D=['D',[]]
F=['F',[]]
A=['A',[D,E]]
B=['B',[]]
C=['C',[F]]
Root=['Root',[A,B,C]]
print(Root)
2 使用类的方式构建二叉树会简单一些
class BTree:
def __init__(self,value):
self.left = None
self.right = None
self.data = value
def insertleft(self,value):
self.left = BTree(value)
return self.left
def insertright(self,value):
self.right = BTree(value)
return self.right
def show(self):
print(self.data)
if __name__=='__main__':
Root=BTree('Root')
A=Root.insertleft('A')
C=A.insertleft('C')
D = A.insertright('D')
F = D.insertleft('F')
G = D.insertright('G')
B = Root.insertright('B')
E=B.insertright('E')
Root.show()
Root.left.show()
Root.right.show()
A=Root.left
A.left.show()
Root.left.right.show()
D=Root.left.right
D.left.show()
D.right.show()
Root.right.right.show()