Monday, October 22, 2012
verifySquenceOfBST
bool verifySquenceOfBST(int squence[], int length)
{
if(NULL==squence|| length < 1)
return false;
int rvalue = squence[length-1];
for(int i=0;i<length;i++)
{
if(squence[i] > rvalue)
break;
}
for(int j=i;j<length;j++)
{
if(squence[j]<rvalue)
return false;
}
bool left=ture;
if(i>0)
left = verifySquenceOfBST(squence, i);
bool right=ture
if(i<length-1)
right = verifySquenceOfBST(squence+i;length-i-1);
return (left&&right);
}
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment