Build Binary Tree from Preorder and Inorder Traversal

Statement

Create a binary tree from two integer arrays, pOrder and iOrder, where pOrder represents a preorder traversal of a binary tree, and iOrder represents an inorder traversal of the same tree.

Constraints:

• $1 \leq$ pOrder.length, iOrder.length $\leq1000$
• iOrder.length $==$ pOrder.length
• $-1000 \leq$ pOrder[i], iOrder[i] $\leq 1000$
• pOrder and iOrder consist of unique values.
• Each value of iOrder also appears in pOrder and vice versa.

Examples