面试题24：二叉搜索树的后序遍历序列

题目描述
输入一个整数数组，判断该数组是不是某二叉搜索树的后序遍历的结果。如果是则输出Yes,否则输出No。假设输入的数组的任意两个数字都互不相同。

---

解：
二叉搜索树有序+ 后序遍历特点

---

class Solution {public:    bool VerifySquenceOfBST(vector<int> sequence) {        // 假定空序列结果为false        if(sequence.empty())            return false;        int root = *(sequence.end()-1);        int index = 0;        while(*(sequence.begin()+index) < root)            ++index;        int temp = index;        while((sequence.begin()+temp) != sequence.end()){            if(*(sequence.begin()+temp) < root)                return false;            ++temp;        }        vector<int> left(sequence.begin(), sequence.begin()+index);        vector<int> right(sequence.begin()+index, sequence.end()-1);        bool result = true;        if(!left.empty())            result = VerifySquenceOfBST(left);        if(result && !right.empty())            result = VerifySquenceOfBST(right);        return result;    }};