**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
TreeNode* reConstructBinaryTree(vector<int> pre,vector<int> vin) {
int len = vin.size();
if(len ==0)
return NULL;
vector<int> pre_right,pre_left,vin_right,vin_left;
TreeNode* head = new TreeNode( pre[0]);
int tem= 0;
for (int i =0 ;i < len; i++){
if(vin[i]==pre[0]){
tem = i ;
break;
}
}
for(int i = 0; i < tem; i++){
pre_left.push_back(pre[i+1]);
vin_left.push_back( vin[i]);
}
for(int i = tem+1; i <len; i++){
pre_right.push_back(pre[i]);
vin_right.push_back( vin[i]);
}
head->left = reConstructBinaryTree( pre_left,vin_left);
head->right = reConstructBinaryTree( pre_right,vin_right);
return head;
}
};