判断数组是否是搜索二叉树的后序遍历

package test;



public class Test3 {
	
	static boolean check_tree(int[] arr,int low,int len){
		int i = low;
		for(;i arr[len-1]){
				break;
			}
		}
		
		int j = i;
		for(;j0){
			left = check_tree(arr, 0, i);
		}
		boolean right = true;
		if(j