##从下往上面插入节点
代码
class BinaryTree: def __init__(self,root): self.key=root self.left_child=None self.right_child=None def insert_left(self,newNode): if self.left_child==None: self.left_child=newNode else: t=BinaryTree(newNode) t.left_child=self.left_child self.left_child=t def insert_right(self,newNode): if self.right_child==None: self.right_child=newNode else: t=BinaryTree(newNode) t.right_child=self.right_child self.right_child=t def get_right_child(self): return self.right_child def get_left_child(self): return self.left_child def set_root_val(self,obj): self.key=obj def get_root_val(self): return self.key r = BinaryTree('a') print(r.getRootVal()) r.insertLeft('b') r.insertLeft('d') print(r.getLeftChild().getRootVal(