二叉搜索树的后序遍历序列

 1 class Solution {
 2 private:
 3     bool find(vector<int> sequence,int l,int r){
 4         int head=l;
 5         int tail=r-1;
 6         if(l>=r) return true;
 7         while(l<r&&sequence[l]<sequence[r]) l++;
 8         for(int i=l;i<r;i++){
 9             if(sequence[i]<sequence[r])
10                 return false;
11         }
12         return find(sequence,head,l-1)||find(sequence,l,tail);
13     }
14 public:
15     bool VerifySquenceOfBST(vector<int> sequence) {
16         if(sequence.empty()) return false;
17         return find(sequence,0,sequence.size()-1);
18 
19     }
20 };