输入某二叉树的前序遍历和中序遍历的结果,请重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。例如输入前序遍历序列{1,2,4,7,3,5,6,8}和中序遍历序列{4,7,2,1,5,3,8,6},则重建二叉树并返回。
/**
* 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) {
if(pre.empty() || vin.empty() || pre.size() != vin.size())
return nullptr;
return _reConstructBinaryTree(pre.begin(),vin.begin(),pre.size());
}
TreeNode* _reConstructBinaryTree(vector<int>::iterator pre,vector<int>::iterator vin,size_t size)
{
if(size == 0)
return nullptr;
int pos = 0;
for(size_t i = 0;i<size;++i)
{
if(pre[0] == vin[i])
{
pos = i;
break;
}
}
TreeNode *root = new TreeNode(pre[0]);
root->left = _reConstructBinaryTree(pre+1,vin,pos);
root->right = _reConstructBinaryTree(pre+pos+1,vin+pos+1,size-pos-1);
return root;
}
};