剑指offer 面试题33 二叉搜索树的后序遍历序列

使用递归
根据根节点找出左右子树

#include<iostream>

using namespace std;

bool VerifySquenceOfBST(int sequence[], int length)
{
	if (sequence == nullptr || length <= 0)
		return false;
	int root = sequence[length - 1];
	int i = 0;
	for (; i < length - 1; ++i)
	{
		if (sequence[i] > root)
			break;
	}

	int j = i;
	for (; j < length - 1; ++j)
	{
		if (sequence[j] < root)
			return false;
	}
	bool left = true;
	if (i > 0)
		left = VerifySquenceOfBST(sequence, i);
	bool right = true;
	if (i < length - 1)
		right = VerifySquenceOfBST(sequence, length - i - 1);

	return(left&&right);

}


int main()
{
	int a[] = {5,7,6,9,11,10,8};
	bool result = VerifySquenceOfBST(a, 7);
	cout << result << endl;

	cin.get();
	return 0;
}