剑指offer——二叉搜索树的后序队列

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 l, int r) {        if(l >= r) return true;        int root = sequence[r];        int i = l;        while (l < r && sequence[l++]< root);        for(int j = l; j < r; ++j)            if(sequence[j] > root) return false;        return judge(sequence, l, i-1) && judge(sequence, i, r-1);    }}