题解 | #二叉搜索树的后序遍历序列#

# -*- coding:utf-8 -*-
# -*- coding:utf-8 -*-
# -*- coding:utf-8 -*-
class Solution:
    def VerifySquenceOfBST(self, sequence):
        # write code here
        s=len(sequence)
        index=0
        if s==0:
            return False
        for i in range(s):
            if sequence[i]>sequence[-1]:
                index=i
                break
        for j in range(i,s):
            if sequence[j]<sequence[-1]:
                return False
        left=True
        right=True
        if len(sequence[:index])>0:
            left=self.VerifySquenceOfBST(sequence[:index])
        if len(sequence[index:-1])>0:
            right=self.VerifySquenceOfBST(sequence[index:-1])
        return right and left