【剑指Offer】 23.二叉搜索树的后序遍历序列 python实现

题目描述

输入一个整数数组，判断该数组是不是某二叉搜索树的后序遍历的结果。如果是则输出Yes,否则输出No。假设输入的数组的任意两个数字都互不相同。

输入	输出
[4, 5, 8, 3, 9, 10, 7]	False
[4, 5, 6, 3, 8, 9, 7]	True
[5, 6, 20, 15, 10]	False

Python 代码

class Solution:
    def VerifySquenceOfBST(self, sequence):
        length = len(sequence)
        if length:
            root = sequence[-1]  # 找到根节点
            left = 0
            while sequence[left] < root:
                left += 1
            right = left
            while right < length - 1:
                if sequence[right] < root:
                    return False
                right += 1
            left_ret = True if left == 0 else self.VerifySquenceOfBST(sequence[:left])
            right_ret = True if left == right else self.VerifySquenceOfBST(sequence[left:right])
            return left_ret and right_ret
        return False

if __name__ == '__main__':
    s = Solution()
    print(s.VerifySquenceOfBST([4, 5, 8, 3, 9, 10, 7]))  # False
    print(s.VerifySquenceOfBST([4, 5, 6, 3, 8, 9, 7]))  # True
    print(s.VerifySquenceOfBST([5, 6, 20, 15, 10]))  # False