按层输入一颗满二叉树，判断是不是二叉搜索树

import java.util.Scanner;
//  10,5,15,2,7,12,17
public class Main {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		String str = in.next();
		String[] strs = str.split(",");
		boolean flag = true;
		if(strs[0].equals("None")) {
			flag =true;
			System.out.println(flag);
		}else {
			int[] arr = new int[strs.length+1];
			int num = 0;

			for (int i = 0; i < strs.length; i++) {
				arr[num+1] = Integer.parseInt(strs[i]);
				num++;
			}
			for (int i = 1; i <= num/2; i++) {
				if(arr[2*i] > arr[i] || arr[2*i+1] < arr[i] ){
					flag = false;
					break;
				}
			}
			System.out.println(flag);
		}
	}
}