描述
给定某二叉树的前序遍历和中序遍历,请重建出该二叉树并返回它的头结点。
例如输入前序遍历序列{1,2,4,7,3,5,6,8}和中序遍历序列{4,7,2,1,5,3,8,6},则重建出如下图所示。
提示:
1.0 <= pre.length <= 2000
2.vin.length == pre.length
3.-10000 <= pre[i], vin[i] <= 10000
4.pre 和 vin 均无重复元素
5.vin出现的元素均出现在 pre里
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 || vin.size() ==0)
return NULL;
else
return build(pre, 0, pre.size()-1, vin, 0, vin.size());
}
TreeNode* build(vector<int> pre, int a1, int b1, vector<int> vin, int a2, int b2){
TreeNode* root = new TreeNode(pre[a1]);
int i = a2;
while(vin[i] != pre[a1])
i++;
int left = i - a2;
int right = b2 - i;
if(left > 0)
root -> left = build(pre, a1 + 1, a1 + left, vin, a2, i-1);
if(right>0)
root -> right = build(pre, a1+left+1, b1, vin, i+1, b2);
return root;
}
};