题目描述:
输入某二叉树的前序遍历和中序遍历的结果,请重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。例如输入前序遍历序列{1,2,4,7,3,5,6,8}和中序遍历序列{4,7,2,1,5,3,8,6},则重建二叉树并返回。
示例:
本题按照先序和中序来重建二叉树,个人思路就是顺序遍历先序的结果,然后把每一次的先序放入到中序中,将在中序的位置为pos,从low到pos-1就构成了该节点的左子树,pos+1到high构成了该二叉树的右子树。然后递归即可。
代码如下:
/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
int findPos(vector<int> &pre,vector<int> &vin, const int &prePos)
{
int i = 0;
for(; i < vin.size(); i++)
if(pre[prePos] == vin[i])break;
return i;
}
TreeNode* createTree(vector<int> &pre, vector<int> &vin, int &prePos, int low, int high)
{
if(low <= high and prePos < pre.size())
{
int pos = findPos(pre, vin, prePos++);
TreeNode* tree = new TreeNode(vin[pos]);
tree->left = createTree(pre, vin, prePos, low, pos - 1);
tree->right = createTree(pre, vin, prePos, pos + 1, high);
return tree;
}
return NULL;
}
TreeNode* reConstructBinaryTree(vector<int> pre,vector<int> vin) {
int prePos = 0;
return createTree(pre, vin, prePos,0, pre.size() - 1);
}
};