题目描述
输入某二叉树的前序遍历和中序遍历的结果,请重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。例如输入前序遍历序列{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.size() == 0)
{
return NULL;
}
TreeNode* head = new TreeNode(pre[0]);
vector<int> pre_left, vin_left, pre_right, vin_right;
int root;
for(int i = 0; i!=vin.size();i++)
{
if(vin[i] == pre[0])
{
root = i;
break;
}
}
for(int i = 0; i < root; i++)
{
pre_left.push_back(pre[i+1]);
vin_left.push_back(vin[i]);
}
for(int i = root + 1; i < vin.size(); 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;
}
};