Given two integer arrays preorder and inorder where preorder is the preorder traversal and inorder is the inorder traversal of the same tree, construct and return the binary tree.
Example: preorder , inorder produces tree .
This problem tests your understanding of traversal orders and recursive construction. Constraints: arrays have length to , values from to , all values unique.