链接:https://www.nowcoder.com/questionTerminal/8a19cbe657394eeaac2f6ea9b0f6fcf6
来源:牛客网
输入某二叉树的前序遍历和中序遍历的结果,请重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。例如输入前序遍历序列{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 length = pre.size();
if (length == 0)
return NULL;
return ConstructCore(pre.begin(), pre.end() - 1, vin.begin(), vin.end() - 1);
}
TreeNode* ConstructCore(vector<int>::iterator startPreorder, vector<int>::iterator endPreorder,
vector<int>::iterator startInorder, vector<int>::iterator endInorder)
{
TreeNode *root = new TreeNode(*startPreorder);
if (endPreorder == startPreorder)
return root;
auto headInorder = find(startInorder, endInorder, *startPreorder);
int length = headInorder - startInorder;
if (length > 0)
root->left = ConstructCore(startPreorder + 1, startPreorder + length, startInorder, headInorder - 1);
if (headInorder != endInorder)
root->right = ConstructCore(startPreorder + length + 1, endPreorder, headInorder + 1, endInorder);
return root;
}
};