public class Solution {    public boolean VerifySquenceOfBST(int [] sequence) {        if (sequence.length == 0) {            return false;        }        return judge(sequence, 0, sequence.length-1);    }    public boolean judge(int[] sequence, int left, int right) {        if (left >= right)            return true;        int i = right;        while (i > left && sequence[i - 1] > sequence[right])            --i;        for (int j = i - 1; j >= left; --j) {            if (sequence[j] > sequence[right]) {                return false;            }        }        return judge(sequence, left, i - 1) && judge(sequence, i, right - 1);    }}