二叉搜索树的后序遍历

public class Solution {
    public boolean VerifySquenceOfBST(int [] seq) {
        if(seq==null||seq.length==0){
            return false;
        }
        return VerifySquenceOfBST(seq,0,seq.length-1);
    }
    public boolean VerifySquenceOfBST(int [] seq,int start,int end){
        if(start>=end){
            return true;
        }
        int root=seq[end];
        int i=start;
        while(seq[i]<root){
            i++;
        }
        int j=i;
        while(j<end){
            if(seq[j]<root){
                return false;
            }
            j++;
        }
        return VerifySquenceOfBST(seq,0,i-1)&&VerifySquenceOfBST(seq,i,end-1);
        
    }
}