TreeNode* rebuild(const vector<int> &pre, const vector<int> &vin, int pre_left, int pre_right, int vin_left, int vin_right) { if (vin_left>vin_right || pre_left>pre_right) return NULL; int gen = -1; for (int i = vin_left; i<vin_right>left = rebuild(pre, vin, pre_left + 1, pre_left + gen - vin_left, vin_left, gen - 1); root->right = rebuild(pre, vin, pre_right-vin_right+gen+1, pre_right, gen + 1, vin_right); return root; }</vin_right></int></int>