根据后序遍历序列，判断是否为二叉搜索树

bool is_bst(int begin, int end, const vector<int>& sequence)
{
	cout << begin << "|" << end << endl;
	if (begin<0 || begin>sequence.size() - 1 || end<0 || end>sequence.size() - 1)
	{
		return false;
	}
	if (begin == end)
	{
		return true;
	}
	int a = begin;
	int b = begin, c = end - 1;
	int d = end-1;
	int root = sequence[end];
	for (int i = begin; i < end; i++)
	{
		if (sequence[i] < root)
		{
			b = i;
		}
		else
		{
			break;
		}
	}
	for (int i = d; i > b; i--)
	{
		if (sequence[i] > root)
		{
			c = i;
		}
		else
		{
			return false;
		}
	}

	return is_bst(a, b, sequence) && is_bst(c, d, sequence);
}

bool verifySequenceOfBST(vector<int> sequence)
{
	if (sequence.empty())
	{
		return true;
	}
	return is_bst(0, sequence.size() - 1, sequence);
}

传入一个元素类型为int的数组，数组最后一位为根节点，每次取到左右子树并递归是否为二叉搜索树，得出该序列是否为一二叉搜索树的后序遍历。