【Java - J - 07】重建二叉树

题目描述

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

练习地址

lc

实现

方法：递归

/**
 * 07-重建二叉树
 * 前序：{1,2,4,7,3,5,6,8} 根左右
 * 中序：{4,7,2,1,5,3,8,6} 左根右
 */
public class C07_tree_RebuildTree {
    public class TreeNode {
        int val;
        TreeNode left;
        TreeNode right;

        TreeNode(int x) {
            this.val = x;
        }
    }

    public TreeNode rebuildTree(int[] pre, int[] in) {
        if (pre == null || in == null) {
            return null;
        }
        return buildCore(
                pre, 0, pre.length - 1,
                in, 0, in.length - 1);
    }

    TreeNode buildCore(int[] pre, int preStart, int preEnd, int[] in, int inStart, int inEnd) {
        if (preStart > preEnd || inStart > inEnd)
            return null;

        TreeNode root = new TreeNode(pre[preStart]); //前序第1个为根节点
        for (int i = inStart; i <= inEnd; i++) // <=
            if (in[i] == pre[preStart]) {
                root.left = buildCore(
                        pre, preStart + 1, preStart +( i - inStart),
                        in, inStart, i - 1
                );
                root.right = buildCore(
                        pre, preStart + (i - inStart )+ 1, preEnd,
                        in, i + 1, inEnd
                );
                break;
            }
        return root;
    }
}