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

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

输入一个整数数组，判断该数组是不是某个二叉搜索树后序遍历结果？

public class Offer39 {
    public static void main(String[] args) {
        int[] data = {5,7,6,9,11,10,8};
        boolean test = test(data, 0, data.length);
        System.out.println(test);
    }

    public static boolean test(int[] data,int start,int length){
        if(data==null||data.length==0)return false;
        //获取根节点
        int root = data[length-1];
        //判断左子树都小于根节点,这里其实就是找到左右子树分割处
        int i = start;
        for (; i < length-1; i++) {
            if(data[i]>root)break;
        }
        //判断右子树的值都大于根节点
        int j = i;
        for (; j < length-1; j++) {
            if(data[j]<root)return false;
        }
        //判断左子树是不是搜索树
        boolean left = true;
        if(i>0){
            left = test(data,0,i);
        }
        //判断右子树是不是搜索树
        boolean right = true;
        if(j<length-1){
            right = test(data,i+1,length-1-i);
        }

        return left&&right;
    }
}