题目描述
输入某二叉树的前序遍历和中序遍历的结果,请重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。例如输入前序遍历序列{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(vin.size()==0 || pre.size() == 0)
return NULL;
int k;
for(int i=0;i<vin.size();i++){
if(pre[0]==vin[i]){
k=i;
break;
}
}
TreeNode *node=new TreeNode(pre[0]);
vector<int> left_vin;
vector<int> left_pre;
vector<int> right_vin;
vector<int> right_pre;
for(int i=0;i<k;i++){
left_vin.push_back(vin[i]);
left_pre.push_back(pre[i+1]);
}
//前序遍历序列{1,2,4,7,3,5,6,8}
//中序遍历序列{4,7,2,1,5,3,8,6}
for(int i=k+1;i<vin.size();i++){
right_vin.push_back(vin[i]);
right_pre.push_back(pre[i]);
}
node->left=reConstructBinaryTree(left_pre,left_vin);
node->right=reConstructBinaryTree(right_pre,right_vin);
return node;
}
};
class Solution
{
public:
TreeNode* reConstructBinaryTree(vector<int> pre,vector<int> vin)
{
if(pre.size()<=0||vin.size()<=0)
return NULL;
TreeNode *root=new TreeNode(pre[0]);
//前序遍历序列{1,2,4,7,3,5,6,8}和中序遍历序列{4,7,2,1,5,3,8,6}
for(int i=0;i<vin.size();i++)
{
if(pre[0]==vin[i])
{
root->left=reConstructBinaryTree(copy(pre,1,i),copy(vin,0,i-1));
root->right=reConstructBinaryTree(copy(pre,i+1,pre.size()-1),copy(vin,i+1,vin.size()-1));
break;
}
}
return root;
}
vector<int> copy(vector<int> array,int begin,int end)
{
vector<int> temp;
while(begin<=end)
{
temp.push_back(array[begin++]);
}
return temp;
}
};
二叉树去掉根节点,左孩子和右孩子都是新的树,前序遍历序列{1,2,4,7,3,5,6,8},从中序遍历的根节点位置分开,它的左孩子的前序遍历为{2,4,7},右孩子为{3,5,6,8},以此类推。先找根节点在中序遍历中的位置,再把左右子树分开,递归创建树。
用迭代器方法实现:
class Solution
{
public:
TreeNode* reConstructBinaryTree(vector<int> pre, vector<int> vin)
{
if (pre.size() <= 0 || vin.size() <= 0)
return NULL;
//前序遍历序列{1,2,4,7,3,5,6,8}和中序遍历序列{4,7,2,1,5,3,8,6}
TreeNode* node = new TreeNode(pre[0]);
for (auto itVin = vin.begin(); itVin != vin.end(); ++itVin)
if (*itVin == pre[0]) {
auto itPre = pre.begin() + 1 + (itVin - vin.begin());
node->left = reConstructBinaryTree(copy(pre,pre.begin() + 1, itPre), copy(vin,vin.begin(), itVin));
node->right = reConstructBinaryTree(copy(pre,itPre, pre.end()), copy(vin,itVin + 1, vin.end()));
}
return node;
}
vector<int> copy(vector<int> array, vector<int> ::iterator be, vector<int> ::iterator en)
{
vector<int> temp;
temp.assign(be, en);
return temp;
}
};
class Solution
{
public:
TreeNode* reConstructBinaryTree(vector<int> pre, vector<int> vin)
{
if (pre.size() <= 0 || vin.size() <= 0)
return NULL;
//前序遍历序列{1,2,4,7,3,5,6,8}和中序遍历序列{4,7,2,1,5,3,8,6}
TreeNode* node = new TreeNode(pre[0]);
for (auto itVin = vin.begin(); itVin != vin.end(); ++itVin)
if (*itVin == pre[0]) {
auto itPre = pre.begin() + 1 + (itVin - vin.begin());
node->left = reConstructBinaryTree(vector<int>(pre.begin() + 1, itPre), vector<int>(vin.begin(), itVin));
node->right = reConstructBinaryTree(vector<int>(itPre, pre.end()), vector<int>(itVin + 1, vin.end()));
}
return node;
}
};