23.判断是不是二叉搜索树的序列

public class Solution {
    public boolean VerifySquenceOfBST(int [] sequence) {
        boolean flag = true;

        if(sequence.length == 0) {
            return false;
        }
        
        int root = sequence[sequence.length-1];
        for(int i = 0; i < sequence.length-2; i++) {
            if(flag) {
                if(sequence[i] > root) {
                    flag = false;
                }
            }else {
                if(sequence[i] < root) {
                    return false;
                }
            } 
        }
        return true;
    }
}