剑指Offer Java 输入某二叉树的前序遍历和中序遍历的结果，请重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。例如输入前序遍历序列{1,2,4,7,3,5,6,8}和中序遍

题目描述

输入某二叉树的前序遍历和中序遍历的结果，请重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。例如输入前序遍历序列{1,2,4,7,3,5,6,8}和中序遍历序列{4,7,2,1,5,3,8,6}，则重建二叉树并返回。

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) {
        return getTree(pre, 0, pre.length-1, in, 0, in.length -1);
    }
    
    private TreeNode getTree(int[] pre, int prefFirst, int preLast, int[] in, 
                         int inFirst, int inLast){
        if(preLast < prefFirst || inLast < inFirst){
            return null;
        }
        TreeNode treeNode = new TreeNode(pre[prefFirst]);
        for(int i = inFirst; i <= inLast; i++){
            if(in[i] == pre[prefFirst]){
              treeNode.left = getTree(pre, prefFirst + 1, prefFirst + i - inFirst, 
                                      in, inFirst, i - 1);
              treeNode.right = getTree(pre, prefFirst + i - inFirst + 1, preLast, 
                                      in, i + 1, inLast);
            }
        }
        pre[prefFirst] = treeNode.val;
        return treeNode;
    }
}