题目描述
输入某二叉树的前序遍历和中序遍历的结果,请重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。例如输入前序遍历序列{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) {
TreeNode root = Construct(pre,0,pre.length-1,in,0,in.length-1);
return root;
}
public TreeNode Construct(int[]pre,int prestart,int preend,int[] in, int instart,int inend){
if(prestart>preend||instart>inend)return null;
TreeNode node = new TreeNode(pre[prestart]);
for(int i = instart;i<=inend;i++){
if(in[i]==pre[prestart]){
//从i-1与instart中间一共有 i-1-instart+1个元素(即i-instart个),所以结束应该为从第一个元素(prestart+1)后面取出i-instart-1个元素,相加则为prestart+i-instart
node.left = Construct(pre, prestart+1, prestart+i-instart, in, instart, i-1);
//从prestart+i-instart后面一个元素开始,到最后
node.right = Construct(pre, prestart+i-instart+1, preend, in, i+1, inend);
}
}
return node;
}
}