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

题目：输入一个整数数组，判断该数组是不是某二叉搜索树的后序遍历的结果。如果是则返回true，否则返回false。假设输入的数组的任意两个数字都互不相同。

// Type your C++ code and click the "Run Code" button!
// Your code output will be shown on the left.
// Click on the "Show input" button to enter input data to be read (from stdin).

#include <iostream>
using namespace std;
bool VerifySquenceOfBST( int data[], int len )
{
    if( data == NULL || len <= 0 )
    {
        return false;
    }
    
    int root = data[ len - 1 ];
    int i=0;
    int j;
    
    for( ; i < len - 1; i++ )
    {
        if( data[i] > root )
        {
            break;
        }
    }
    
    j = i;
    
    for( ; j < len - 1; j++ )
    {
        if( data[j] < root )
        {
            return false;
        }
    }
    
    bool left = true;
    bool right = true;
    
    if( i > 0 )
    {
        left =VerifySquenceOfBST( data, i ); 
    }
    
    if( i < len - 1 )
    {
        right=VerifySquenceOfBST( data+i, len - i - 1 );
    }
    
    return ( left && right );
}
int main() {
    // Start typing your code here...
    cout << "Hello world!" << endl;
    
    
    return 0;
}