0105-construct-binary-tree-from-preorder-and-inorder-traversal

Try it on leetcode

Description

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.

 

Example 1:

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

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.

Solution(Python)

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right

from typing import List, Optional

class Solution:
    def buildTree(self, preorder: List[int], inorder: List[int]) -> Optional[TreeNode]:
        """
        Construct a binary tree from preorder and inorder traversal arrays.
      
        Args:
            preorder: List of node values in preorder traversal
            inorder: List of node values in inorder traversal
          
        Returns:
            Root node of the constructed binary tree
        """
      
        inorder_idx = {val: i for i, val in enumerate(inorder)}
        pre_idx = 0

        def build(left: int, right: int) -> TreeNode | None:
            nonlocal pre_idx

            if left > right:
                return None

            # Preorder: root comes first
            node_val = preorder[pre_idx]
            pre_idx += 1

            node = TreeNode(node_val)
            mid = inorder_idx[node_val]

            # Build left subtree first
            node.left = build(left, mid - 1)
            node.right = build(mid + 1, right)

            return node

        return build(0, len(inorder) - 1)