程序员算法之判断序列是否是二叉查找树的后续

#include <stdio.h>
bool VerifySquenceBST(int *Squence,int length)
{
if(Squence == NULL || length <= 0) return false;
int root = Squence[length - 1];
for(int i = 0;i < length-1;++i)
{
if(Squence[i] > root) break;
}
int j = i;
for(;j < length-1;++j)
{
if(Squence[j] < root) return false;
}

bool left = true;
if(i > 0)
{
left = VerifySquenceBST(Squence,i);
}
bool rigth = true;
if(j < length-1)
{
rigth = VerifySquenceBST(Squence + i,length-i-1);
}
if(left && rigth) return true;
else return false;
}

int main()
{
int Squence[7] = {5,7,6,9,11,10,8};
bool test = VerifySquenceBST(Squence,7);
if(test == true) printf("The Squence is BST\n");
else printf("The Squence is not BST\n");
return 0;
}