Reconstruct Binary Tree Traversals

Problem

Given two integer arrays preorder and inorder representing the preorder and inorder traversals of the same binary tree, reconstruct the binary tree and return its root. Assume all node values are unique, and the traversals are valid.

Constraints

• 1 <= preorder.length <= 3000
• preorder.length == inorder.length
• -3000 <= preorder[i], inorder[i] <= 3000
• All values in preorder and inorder are unique
• inorder is a valid inorder traversal of the tree represented by preorder