题目描述
输入一个整数数组,判断该数组是不是某二叉搜索树的后序遍历的结果。如果是则输出Yes,否则输出No。假设输入的数组的任意两个数字都互不相同。
class Solution {
public:
bool VerifySquenceOfBST(vector<int> sequence) {
return bst(sequence,0,sequence.size()-1);
}
bool bst(vector<int> sequence,int begin,int end)
{
if(sequence.empty() || begin>end)
return false;
int root = sequence[end];
int i = begin;
for(; i < end; ++i)
{
if(sequence[i] > root)
break;
}
//left_root = sequence[i-1];
int j = i;
for(; j < end; ++j)
{
if(sequence[j] < root)
return false;
}
//right_root = sequence[j];
bool left = true;
if(i > begin)
left = bst(sequence,begin,i-1);
bool right = true;
if(j < end-1)
right = bst(sequence,i,end-1);
return (left && right);
}
};