Construct Binary Tree from Preorder and Inorder

1. 1
   Learn the pattern

   Pick the traversal first: inorder for BST order, level-order for depth, postorder to bubble info up.

2. 2
   Trace your version

   Paste your solution into the workspace and watch every step execute.

   Open workspace
3. 3
   Solve it

   Solve it on LeetCode, then mark it solved here to keep your streak alive.

   Solve on LeetCode Mark solved