public static int treeNum(int start, int end) {
		if (start >= end)
			return 1;
		int treeNum = 0;
		for (int i = start; i <= end; i++) {
			treeNum += treeNum(start, i - 1) * treeNum(i + 1, end);

		}
		return treeNum;
	}