题目:输入某二叉树的前序遍历和中序遍历的结果,请重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。例如输入前序遍历序列{1,2,4,7,3,5,6,8}和中序遍历序列{4,7,2,1,5,3,8,6},则重建二叉树并返回。
解题思路:其实就是一个递归的思想,先找到根节点,然后递归构建出左子节点和右子节点即可
解法如下:
/**
* 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) {
if(pre.length==0&&in.length==0){
return null;
}
if(pre.length==1&&in.length==1){
return new TreeNode(pre[0]);
}
TreeNode root = new TreeNode(pre[0]);
int temp = 0;
for(int i=0;i<in.length;i++){
if(in[i]==pre[0]){
temp = i;
}
}
int[] leftPre = new int[temp];
for(int i=0;i<leftPre.length;i++){
leftPre[i] = pre[i+1];
}
int[] leftIn = new int[temp];
for(int i=0;i<leftIn.length;i++){
leftIn[i] = in[i];
}
int[] rightPre = new int[pre.length-temp-1];
for(int i=0;i<rightPre.length;i++){
rightPre[i] = pre[temp+1+i];
}
int[] rightIn = new int[in.length-temp-1];
for(int i=0;i<rightIn.length;i++){
rightIn[i] = in[temp+1+i];
}
root.left = reConstructBinaryTree(leftPre,leftIn);
root.right = reConstructBinaryTree(rightPre,rightIn);
return root;
}
}
其实可以更简单一点
public class Solution {
public TreeNode reConstructBinaryTree(int [] pre,int [] in) {
TreeNode root=reConstructBinaryTree(pre,0,pre.length-1,in,0,in.length-1);
return root;
}
//前序遍历{1,2,4,7,3,5,6,8}和中序遍历序列{4,7,2,1,5,3,8,6}
private TreeNode reConstructBinaryTree(int [] pre,int startPre,int endPre,int [] in,int startIn,int endIn) {
if(startPre>endPre||startIn>endIn)
return null;
TreeNode root=new TreeNode(pre[startPre]);
for(int i=startIn;i<=endIn;i++)
if(in[i]==pre[startPre]){
root.left=reConstructBinaryTree(pre,startPre+1,startPre+i-startIn,in,startIn,i-1);
root.right=reConstructBinaryTree(pre,i-startIn+startPre+1,endPre,in,i+1,endIn);
}
return root;
}
}