Python实现二叉树

class Btree:
    root = None
    def __init__(self, data=None):
        root = self.Node(data)
        self.root = root
    def append(self,data):
        node = self.Node(data)
        if self.root is None:
            self.root=node
        else:
            self.root.append(node)
    class Node:
        data = None
        left = None
        right = None
        def __init__(self, data=None):
            self.data=data
        def append(self,node): #追加函数
            if self.data > node.data: 
                if self.left is None: 
                    self.left=node
                else:
                    self.left.append(node)
            else:
                if self.right is None:
                    self.right=node
                else:
                    self.right.append(node)
        def zPrint(self):      #中序输出
            if self.left is not None:
                self.left.zPrint()

            print(self.data)

            if self.right is not None:
                self.right.zPrint
    def zPrint(self):
        self.root.zPrint()

添加数据并中序输出

btree=Btree(5)
btree.append(3)
btree.append(7)
#....*n
btree.zPrint()