Construct Binary Tree from Preorder and Postorder Traversal

Reconstruct a binary tree from its preorder and postorder traversal arrays of distinct values. The core challenge is using the traversal orders to determine subtree boundaries (preorder gives roots first, postorder roots last) and rebuild the tree, returning any valid tree if multiple exist.