二叉搜索树的后序遍历序列

public class Solution {
    public boolean VerifySquenceOfBST(int[] sequence) {
        if(sequence == null || sequence.length <= 0)
            return false;
        
        int len  = sequence.length;
        
        return solve(sequence, 0, len-1);
        
    }
    
    public boolean solve(int[] sequence, int start, int end) {
        if(start == end)
            return true;
        int root = sequence[end];
        //System.out.println(root);
        int index = start;
        for(; index < end; index ++) {
            if(sequence[index] > root)
                break;
        }
        
        for(int j=index; j<end; j++) {
            if(sequence[j] < root)
                return false;
        }
        
        boolean left = true;
        if(index > start)
            left = solve(sequence, start, index-1);
        
        boolean right = true;
        if(index < end)
            right = solve(sequence, index, end-1);
        
        return  (left && right) ;
        
    }
}