题目描述
输入某二叉树的前序遍历和中序遍历的结果,请重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。例如输入前序遍历序列{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 size = vin.size();
int root = 0;
vector<int> right_pre, right_vin, left_pre, left_vin;
if(size == 0) //递归结束
return NULL;
TreeNode* tree = new TreeNode(pre[0]); //tree构造不能在return NULL之前,发生段错误
for(int i = 0; i < size; i++) //寻找根节点位置
if(pre[0] == vin[i])
{
root = i;
break;
}
for(int i = 0; i < root; i++) //切分前序遍历和中序遍历序列
{
left_pre.push_back(pre[i+1]);
left_vin.push_back(vin[i]);
}
for(int i = root + 1; i < size; i++)
{
right_pre.push_back(pre[i]);
right_vin.push_back(vin[i]);
}
tree->left = reConstructBinaryTree(left_pre, left_vin); //递归调用
tree->right = reConstructBinaryTree(right_pre, right_vin);
return tree;
}
};