Leetcode 106. Construct Binary Tree from Inorder and Postorder Traversal

Reconstruct the unique binary tree from given inorder and postorder traversal arrays by using the last element of postorder as the root and partitioning the inorder array to identify left and right subtrees, then recursively building each subtree. Values are unique and arrays have equal length.