剑指offer24判断某一序列是否是某一搜索二叉树的后续遍历结果

#include<iostream>using namespace std;bool verify(int A[],int length){if(A==NULL||length<=0)return false;int root=A[length-1];int i=0;for(;i<length;++i){if(A[i]>A[root])break;}int j=i;for(;j<length;++j){if(A[j]<A[root])return false;}bool left=true;if(i>0)left=verify(A,i);bool right=true;if(i<length-1)right=verify(A+i,length-i-1);return left&&right;}int main(){system("pause");return 0;}