L2-004 这就是二叉搜索树吗？（python）

 代码如下：

class Node:
    def __init__(self, data):
        self.data = data
        self.lchild = None
        self.rchild = None
class Tree:#创建搜索树
    def creat(self, li):
        root = Node(li[0])
        for i in range(1,len(li)):
            self.insert_(root, li[i])
        return root
    def insert_(self, root, val):
        if root == None:
            root = Node(val)
        elif root.data<val or root.data==val:
            root.rchild = self.insert_(root.rchild, val)
        elif root.data> val:
            root.lchild = self.insert_(root.lchild, val)
        return root
class Tree_1:#创建镜像树
    def creat_1(self, li):
        root = Node(li[0])
        for i in range(1, len(li)):
            self.insert_1(root, li[i])
        return root
    def insert_1(self, root, val):
        if root == None:
            root = Node(val)
        elif root.data>val:
            root.rchild = self.insert_1(root.rchild, val)
        elif root.data< val or root.data==val:#此处相等应将该节点放在左边
            root.lchild = self.insert_1(root.lchild, val)
        return root
def pre(root,pres):#利用递归函数建造前序遍历
    if root!=None:
        pres.append(root.data)
        pre(root.lchild,pres)
        pre(root.rchild,pres)
def post(root,posts):#同理建造后序遍历
    if root != None:
        post(root.lchild,posts)
        post(root.rchild,posts)
        posts.append(root.data)
global press,posts,press_1,posts_1#利用全局定义4个变量，分别用来存放普通搜索二叉树与镜像搜索二叉树的前序与后续。
press=[]
posts=[]
press_1=[]
posts_1=[]
tree = Tree()
tree_1=Tree_1()
n=int(input())
p=list(map(int,input().split()))
root = tree.creat(p)#建造普通搜索二叉树
pre(root,press)
post(root,posts)
root1 = tree_1.creat_1(p)#建造建造搜索二叉树
pre(root1,press_1)
post(root1,posts_1)
if press_1==p:
    print("YES")
    print(*posts_1)
elif press==p:
    print("YES")
    print(*posts)
else:
    print("NO")

 只有23分（测试点五没通过）