题目描述
输入某二叉树的前序遍历和中序遍历的结果,请重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。例如输入前序遍历序列{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) {
int inlen = vin.size();
if(inlen == 0)
return nullptr;
vector<int> left_pre,right_pre,left_in,right_in;
TreeNode *root = new TreeNode(pre[0]);
int gen = 0;
for(int i = 0;i < inlen; ++i)
{
if(vin[i] == pre[0])
{
gen = i;
break;
}
}
for(int i = 0;i < gen; ++i)
{
left_in.push_back(vin[i]);
left_pre.push_back(pre[i + 1]);
}
for(int i = gen + 1;i < inlen; ++i)
{
right_in.push_back(vin[i]);
right_pre.push_back(pre[i]);
}
root->left = reConstructBinaryTree(left_pre,left_in);
root->right = reConstructBinaryTree(right_pre,right_in);
return root;
}
};
对于二叉树,我们要时刻记得,先序遍历的第一个节点是跟节点,在中序遍历中找到这个位置,可以得到根的左子树和右子树,然后根据这一个缩影,进行递归