class Solution {
public:
bool VerifySquenceOfBST(vector<int> sequence) {
if (!sequence.size()) return false;
return IsBST(sequence, 0, sequence.size()-1);
}
bool IsBST( vector<int>& sequence, int start, int end){
if (start>=end) return true; // 可能出现start>end的情况
int p;
for (p=start; sequence[p]<sequence[end]; ++p);
for (int i=p; i<=end; ++i)
if (sequence[i]<sequence[end]) return false;
return IsBST(sequence, start, p-1) && IsBST(sequence, p, end-1);
}
};
剑指数据结构-二叉搜索树的后序遍历序列
最新推荐文章于 2023-03-19 11:29:26 发布