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

bool VerifySquenceOfBST(int sequence[], int len) {
	int i = 0;
	int root = sequence[len - 1];
	for (; i < len - 1; i++) {
		if (sequence[i] > root)break;
	}
	int j = i;
	for (; j < len - 1; j++) {
		if (sequence[j] < root)
			return false;
	}
	//left应该默认为true
	bool left = true;
	if (i > 0) {
		 left = VerifySquenceOfBST(sequence, i);
	}
	bool right = true;
	if (i < len - 1) {
		right = VerifySquenceOfBST(sequence + i, len - i - 1);
	}
	return left && right;
}