题目:
* 输入某二叉树的前序遍历和中序遍历的结果,请重建出该二叉树。 * 假设输入的前序遍历和中序遍历的结果中都不含重复的数字。 * 例如输入前序遍历序列{1,2,4,7,3,5,6,8}和中序遍历序列{4,7,2,1,5,3,8,6}
思想:递归:f(n)的结果是根据f(n-1)的结果递推过来的,
递归可以参考这篇文章:
https://baijiahao.baidu.com/s?id=1629571574350179349&wfr=spider&for=pc
本案例中:f(根节点) = f(左节点) +f(右节点)
因此就很简单了,别忘记递归的结束条件:左右节点的前序和中序长度是1的时候。
public class 前序中序重建二叉树 {
public static void main(String[] args) {
int [] pre = new int[]{1,2,3,4,5,6,7};
int [] in = new int[]{3,2,4,1,6,5,7};
TreeNode node = reConstructBinaryTree(pre,in);
}
public static TreeNode reConstructBinaryTree(int [] pre, int [] in) {
if(pre.length <=0 || in.length <=0|| pre.length != in.length){
return null;
}
int len = pre.length;
if(len<=0){
return null;
}
int value = pre[0];
TreeNode rootNode = createNewTreeNode(value,null,null);
if(len ==1){
return rootNode;
}
int valueLoc = getLocationInAarry(value,in);
int[] leftPre = new int [valueLoc];
int[] leftIn = new int [valueLoc];
int[] rightPre = new int[len-1-valueLoc];
int[] rightIn = new int[len-1-valueLoc];
//左右子树前序数组
for(int i =1; i<len; ++i){
if(i <= valueLoc){
leftPre[i-1] = pre[i];
continue;
}
rightPre[i-valueLoc-1] = pre[i];
}
//左右子树中序数组
for(int i =0; i<len; ++i){
if(i<valueLoc){
leftIn[i] = in[i];
continue;
}
if(i ==valueLoc){
continue;
}
rightIn[i-valueLoc-1] = in[i];
}
rootNode.left = reConstructBinaryTree(leftPre,leftIn);
rootNode.right =reConstructBinaryTree(rightPre,rightIn);
return rootNode;
}
static int getLocationInAarry(int temp,int[] in){
if(temp< 0 || in.length <=0){
return 0;
}
for(int j =0;j< in.length; ++j){
if(in[j] == temp){
return j;
}
}
return -1;
}
static TreeNode createNewTreeNode( int val,TreeNode left, TreeNode right){
TreeNode node = new TreeNode(val);
node.left = left;
node.right = right;
return node;
}
}