Leetcode 105. Construct Binary Tree from Preorder and Inorder Traversal

Reconstruct the original binary tree from its preorder and inorder traversal arrays (with unique values). The core challenge is using preorder to pick each root and partition the inorder sequence to determine left/right subtree sizes, enabling an O(n) construction (often via recursion with an index map).