JZ-004-Rebuild Binary Tree

Rebuild Binary Tree

Title description

Enter the results of pre-order traversal and mid-order traversal of a binary tree, and please rebuild the binary tree. Assume that the input result of pre-order traversal and middle-order traversal does not contain repeated numbers. For example, input the pre-order traversal sequence {1,2,4,7,3,5,6,8} and the middle-order traversal sequence {4,7,2,1,5,3,8,6}, then rebuild the binary tree and return.

Title link: rebuild binary tree

Code

import java.util.*;

public class Jz04 {

    // 缓存中序遍历数组每个值对应的索引
    private static Map<Integer, Integer> indexForInOrders = new HashMap<Integer, Integer>();

    public static TreeNode reConstructBinaryTree(int[] pre, int[] in) {
        for (int i = 0; i < in.length; i++) {
            indexForInOrders.put(in[i], i);
        }
        return reConstructBinaryTree(pre, 0, pre.length - 1, 0);
    }

    /**
     * 递归
     *
     * @param pre
     * @param preL
     * @param preR
     * @param inL
     * @return
     */
    private static TreeNode reConstructBinaryTree(int[] pre, int preL, int preR, int inL) {
        if (preL > preR) {
            return null;
        }
        TreeNode root = new TreeNode(pre[preL]);
        int inIndex = indexForInOrders.get(root.val);
        int leftTreeSize = inIndex - inL;
        root.left = reConstructBinaryTree(pre, preL + 1, preL + leftTreeSize, inL);
        root.right = reConstructBinaryTree(pre, preL + leftTreeSize + 1, preR, inL + leftTreeSize + 1);
        return root;
    }

    public static void main(String[] args) {
          // 测试用例，并打印最后结果
        int[] pre = new int[]{3, 9, 20, 15, 7};
        int[] in = new int[]{9, 3, 15, 20, 7};
        TreeNode treeNode = reConstructBinaryTree(pre, in);
        Queue<TreeNode> nodes = new LinkedList<>();
        nodes.add(treeNode);
        while (!nodes.isEmpty()) {
            TreeNode cur = nodes.poll();
            if (cur != null) {
                System.out.println(cur.val + " ");
                nodes.add(cur.left);
                nodes.add(cur.right);
            }
        }
    }
}

[Daily Message] Your smile is the most healing power, better than the most beautiful scenery in the world.