class Solution {

 public:

     bool VerifySquenceOfBST(vector<int> sequence) {

         if (sequence.size() == )return false;

         return isBST(sequence, , sequence.size() - );

     }

     bool isBST(vector<int>v, int L, int R)

     {

         if (L >= R)return true;

         int root = v[R];

         int i = L;

         while (v[i] < root)++i;//找到左子树

         int j = i;

         while (j < R)if (v[j++] < root)return false;//判断右子树

         return isBST(v, L, i - ) && isBST(v, i, R - );

     }

 };