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

Constraints:

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

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps us to check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.