class Solution { public:     TreeNode* reConstructBinaryTree(vector<int> pre,vector<int> vin) {         // 递归法         if(pre.size()==0) return&nbsp...