105. Construct Binary Tree from Preorder and Inorder Traversal

Given two integer arrays preorder and inorder where preorder is the preorder traversal of a binary tree and inorder is the inorder traversal of the same tree, construct and return the binary tree.

1
2
3
4

Example 1:

Input: preorder = [3,9,20,15,7], inorder = [9,3,15,20,7]
Output: [3,9,20,null,null,15,7]

ex1

1
2
3
4

Example 2:

Input: preorder = [-1], inorder = [-1]
Output: [-1]

Constraints:

  • 1 <= preorder.length <= 3000
  • inorder.length == preorder.length
  • -3000 <= preorder[i], inorder[i] <= 3000
  • preorder and inorder consist of unique values.
  • Each value of inorder also appears in preorder.
  • preorder is guaranteed to be the preorder traversal of the tree.
  • inorder is guaranteed to be the inorder traversal of the tree.

Jamboard

jam1

Solution

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    int[] preorder;
    int preorderIndex; 
    Map<Integer, Integer> order;
                   
    public TreeNode buildTree(int[] preorder, int[] inorder) {
           this.preorder = preorder;
           order = new HashMap<>();
           for (int i = 0; i < inorder.length; i++) {
               order.put(inorder[i], i);
           }
           return build(0, preorder.length - 1);
    }
    
    TreeNode build(int start, int end) {
        if (start > end) return null;
        
        TreeNode node = new TreeNode(preorder[preorderIndex]);
        int pos = order.get(preorder[preorderIndex++]);
        node.left = build(start, pos - 1);
        node.right = build(pos + 1, end);
        
        return node;
    }
    
    public TreeNode buildTree2(int[] preorder, int[] inorder) {
        TreeNode root = new TreeNode(preorder[0]);
        Map<Integer, Integer> order = new HashMap<>();
        for (int i = 0; i < inorder.length; i++) {
            order.put(inorder[i], i);
        }
        for (int i = 1; i < preorder.length; i++) {
            addNode(root, preorder[i], order);
        }
        return root;
    }
    
    void addNode(TreeNode node, int val, Map<Integer, Integer> order) {
        if (order.get(val) < order.get(node.val)) {
            if (node.left == null) {
                node.left = new TreeNode(val);
            } else {
                addNode(node.left, val, order);
            }
        } else {
            if (node.right == null) {
                node.right = new TreeNode(val);
            } else {
                addNode(node.right, val, order);
            }
        }
    }
}

Solution 2022-01-30

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    int preorderIndex = 0;
    int[] preorder;
    Map<Integer, Integer> order = new HashMap<>();
    public TreeNode buildTree(int[] preorder, int[] inorder) {
        this.preorder = preorder;
        for (int i = 0; i < inorder.length; i++) {
            order.put(inorder[i], i);
        }
        
        return buildTree(0, order.size() - 1);
    }
    
    TreeNode buildTree(int lo, int hi) {
        if (lo > hi) return null;
        TreeNode node = new TreeNode(preorder[preorderIndex]);
        int pos = order.get(preorder[preorderIndex]);
        preorderIndex++;
        System.out.println("pos = " + pos + " lo " + lo + " " + hi);
        node.left = buildTree(lo, pos - 1);
        node.right = buildTree(pos + 1, hi);
        return node;
    }
}