[二查搜索树]判断一个二查搜索树的后序遍历序列

bool VerifySquenceOfBST(int *sequence, int length) 
{
	if(sequence == 0 || length <= 0)
		return false;
	
	int root = sequence[length - 1];
	int i;
	//check the former part
	//i:thr number of the former part
	for(i = 0; i < length -1; i++)
	{
		if(sequence[i] > root)
			break;
	}
	//check the last part
	int j = i;
	for(; j < length - 1; j++)
	{
		if(sequence[j] < root)
			return false;
	}
	
	//check the left-subtree
	bool left = true;
	if(i > 0)
		left = VerifySquenceOfBST(sequence, i);
	
	// check the right-subtree
	bool right = true;
	if(i < length -1)
		right = VerifySquenceOfBST(sequence + i, length - 1 - i);
	
	return (left && right);
}