输入一个整数数组，判断该数组是不是某二叉搜索树的后序遍历的结果

class Solution:
    def VerifySquenceOfBST(self, sequence):
        # write code here
        if not sequence:
            return False
        root = sequence[-1]
        left = []
        right = []
        m = len(sequence)-1
        for i in range(m):
            if sequence[i]>root:
                left.extend(sequence[:i-1])
                right.extend(sequence[i:m])
                break
        for item in right:
            if item<root:
                return False
        isLeft = True;isRight = True
        if left:
            isLeft = self.VerifySquenceOfBST(left)
        if right:
            isRight = self.VerifySquenceOfBST(right)
        return isLeft and isRight