#include<iostream>//比较难,由前序和后序遍历来确定二叉树,参考了柳婼的#include<vector>usingnamespacestd; vector<int> pre, post, in;boolunique=true;voidgetin(intprel,intprer,intpostl,intpostr){if(prel==prer){ in.push_back(pre[prel]);return; }if(pre[prel]==post[postr]){inti=prel+...