题目描述
输入某二叉树的前序遍历和中序遍历的结果,请重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。例如输入前序遍历序列{1,2,4,7,3,5,6,8}和中序遍历序列{4,7,2,1,5,3,8,6},则重建二叉树并返回。
解法:1.前序遍历第一个值为根节点
2.根据根节点在中序遍历中分为左右两个子树
3.左子树进行中序,前序遍历存储,同理右子树
4.递归调用左右子树,直到返回为空指针
/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
struct TreeNode* reConstructBinaryTree(vector<int> pre,vector<int> in) {
int len = in.size();
vector<int> left_in, left_pre, right_in, right_pre;//in中序遍历,pre前序遍历
int root = 0;
if(len == 0) return NULL;
TreeNode* head = new TreeNode(pre[0]);
for(int i = 0; i < len; i++) {
while(in[i] == pre[0]) {
root = i;
break;
}
}
for(int i = 0; i < root; i++) {
left_in.push_back(in[i]);
left_pre.push_back(pre[i+1]);
}
for(int i = root + 1; i < len; i++) {
right_in.push_back(in[i]);
right_pre.push_back(pre[i]);
}
head->left = reConstructBinaryTree(left_pre, left_in); //返回的是根节点指针
head->right = reConstructBinaryTree(right_pre, right_in);
return head;
}
};