24 二叉搜索树的后序遍历序列

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

C++:

class Solution {
public:
    bool VerifySquenceOfBST(vector<int> sequence) {
        if (sequence.empty())
            return false ;
        return Verify(sequence , 0 , sequence.size()-1) ;
    }
    
    bool Verify(vector<int> sequence,  int left , int right) {
        if (right - left <= 0)
            return true ;
        int rootValue = sequence[right] ;
        int cutIndex = left ;
        for(; cutIndex < right ; cutIndex++){
            if (sequence[cutIndex] > rootValue)
                break ;
        }
        for(int i = cutIndex ; i < right ; i++){
            if (sequence[i] < rootValue)
                return false ;
        }
        return Verify(sequence , left , cutIndex-1) && Verify(sequence , cutIndex , right-1) ;
    }
};