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

class Solution {
public:
    bool VerifySquenceOfBST(vector<int> sequence) {
        if(sequence.size() == 0) return false;
        if(sequence.size() == 1) return true;
        
        int pos = sequence.size()-1;
        int t = 0;
        
        while(pos >= 0){
            while(sequence[t] < sequence[pos]){
                t++;
            }
            while(sequence[t] > sequence[pos]){
                t++;
            }
            if(t != pos) return false;
            
            t = 0;
            pos -= 1;
            
        }
        return true;
    }
};