题目
输入某二叉树的前序遍历和中序遍历的结果,请重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。例如输入前序遍历序列{1,2,4,7,3,5,6,8}和中序遍历序列{4,7,2,1,5,3,8,6},则重建二叉树并返回。
知识准备
四种主要遍历为:
前序遍历:根结点 —> 左子树 —> 右子树
中序遍历:左子树—> 根结点 —> 右子树
后序遍历:左子树 —> 右子树 —> 根结点
层次遍历:按层从左往右遍历
思路
根据前序遍历第一个点得到根节点,然后根据中序遍历,分出左右子树。采用递归方式,重复上述操作即可。
下面的实现空间复杂度太大。可以采用标记方式,传入当前的子树的的首尾下标进行递归实现。避免开辟空间存储子树数组
c++实现
/**
* 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 prelen = pre.size();
if (prelen == 0){
return NULL;
}
vector<int> pre_left, pre_right, vin_left, vin_right;
TreeNode* head = new TreeNode(pre[0]);
int head_index = 0;
while(pre[0] != vin[head_index]){
head_index++;
}
for(int i = 0; i < prelen; i++){
if(i < head_index){
vin_left.push_back(vin[i]);
pre_left.push_back(pre[i+1]);
}
if(i > head_index){
vin_right.push_back(vin[i]);
pre_right.push_back(pre[i]);
}
}
head->left = reConstructBinaryTree(pre_left, vin_left);
head->right = reConstructBinaryTree(pre_right, vin_right);
return head;
}
};
java实现
/**
* Definition for binary tree
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public TreeNode reConstructBinaryTree(int [] pre,int [] in) {
int preLen = pre.length;
if(preLen == 0) return null;
TreeNode ret = new TreeNode(pre[0]);
int headIndex = 0;
while(in[headIndex] != pre[0]) headIndex++;
int[] preLeft = new int[headIndex];
int[] preRight = new int[preLen - headIndex-1];
int[] inLeft = new int[headIndex];
int[] inRight = new int[preLen - headIndex-1];
for(int i = 0; i < preLen; i++){
if(i < headIndex){
preLeft[i] = pre[i+1];
inLeft[i] = in[i];
}
else if(i > headIndex){
preRight[i - headIndex - 1] = pre[i];
inRight[i - headIndex - 1] = in[i];
}
}
ret.left = reConstructBinaryTree(preLeft, inLeft);
ret.right = reConstructBinaryTree(preRight, inRight);
return ret;
}
}