代码: 1//L2-004 这是二叉搜索树吗?2#include<bits/stdc++.h>3usingnamespacestd;4typedeflonglongll;5constintmaxn=1e5+10;6constintinf=0x3f3f3f3f;78intn;9intisMirror=0;10intpre[maxn];11vector<int>vec;1213intbuild(intl,intr)14{15if(l>r)return0;16intrt=pre[l];17intp1=l+1,p2=r...