二叉搜索树的后序遍历

class Solution {
public:
    bool VerifySquenceOfBST(vector<int> sequence) {
        if(sequence.empty())
            return false;
        
        return VerifySquenceOfBSTCore(sequence,0,sequence.size()-1);
    }
private:
    bool VerifySquenceOfBSTCore(vector<int> seq,int start,int end)
    {
        if(start>=end)
            return true;
        
        int i=end-1;
        while(i>=start&&seq[i]>seq[end])
            --i;
        int j=start;
        while(j<=i)
        {
            if(seq[j]>seq[end])
                return false;
            ++j;
        }
        
        return VerifySquenceOfBSTCore(seq,start,i)&&VerifySquenceOfBSTCore(seq,i+1,end-1);
    }
};