二叉搜索树后序遍历序列

  public boolean VerifySquenceOfBST(int [] sequence) {
        if(sequence.length==0)
            return false;
        if(sequence.length==1)
            return true;
        return judge(sequence, 0, sequence.length-1);
    }
    public boolean judge(int [] sequence,int start,int end){
        if (start>=end){
            return true;
        }
        int leftEnd=end-1;
        while (sequence[leftEnd]>sequence[end]&&leftEnd>start)
            leftEnd--;
        if (leftEnd==start){
            return true;
        }
        for(int i=start;i<=leftEnd;i++){
            if (sequence[i]>sequence[end]){
                return false;
            }
        }
        return judge(sequence,start,leftEnd)&&judge(sequence,leftEnd+1,end-1);
    }