4、重建二叉树

题目描述
输入某二叉树的前序遍历和中序遍历的结果，请重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。例如输入前序遍历序列{1,2,4,7,3,5,6,8}和中序遍历序列{4,7,2,1,5,3,8,6}，则重建二叉树并返回。
思路
核心思想就是：利用前序遍历序列的头结点（即为树的root结点）将中序遍历分为两部分，再去递归找到左右结点即可。【前序遍历和中序遍历的定义】
描述起来不太好理解，图片应该就一目了然了。


代码

/**
 * 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;
        int inLen = in.length;
        
        return buildTree(pre,0,preLen - 1,in,0,inLen - 1);
    }
    
    public TreeNode buildTree(int[] pre,int preLeft,int preRight,int[] in,int inLeft,int inRight){
        //递归结束的条件
        if(preLeft > preRight || inLeft > inRight) return null;
        int pivot = pre[preLeft];
        TreeNode root = new TreeNode(pivot);//创建根节点
        int pivotIndex = inLeft;
        while(in[pivotIndex] != pivot){//找到中序遍历中的根节点索引
            pivotIndex++;
        }
        //跳出循环时在中序序列中找到了根节点
        //递归找到左右结点即可
        root.left = buildTree(pre,preLeft + 1,pivotIndex - inLeft + preLeft,in,inLeft,pivotIndex - 1);
        root.right = buildTree(pre,pivotIndex - inLeft + preLeft + 1,preRight,in,pivotIndex + 1,inRight);
        return root;
    }
}

思路来源
https://leetcode-cn.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/solution/qian-xu-bian-li-python-dai-ma-java-dai-ma-by-liwei/