105. Construct Binary Tree from Preorder and Inorder Traversal

Divide and conquer driven by what each traversal tells you. The first element of preorder is always the current subtree's root; locate that value in inorder, and it splits inorder into the left…