输入某二叉树的前序遍历和中序遍历的结果,请重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。例如输入前序遍历序列{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 n=pre.size();
TreeNode* Broot;
Broot = CreateBTree(pre,vin,0,n-1,0,n-1);
return Broot;
}
TreeNode* CreateBTree(vector<int> pre,vector<int> vin,int i1,int i2,int j1,int j2) {
//先序序列存放在pre[i1]~pre[i2]中,中序序列存放在vin[j1]~vin[j2]中,
if(j1>j2)
return NULL;
else
{
TreeNode* root= new TreeNode(pre[i1]); //使用前需要new一个实例化对象出来
int num = 0;
while(pre[i1]!=vin[j1+num])
num++; //计算左子树的结点个数
root->left = CreateBTree(pre,vin,i1+1,i1+num,j1,j1+num-1);
root->right = CreateBTree(pre,vin,i1+num+1,i2,j1+num+1,j2);
return root;
}
}
};