Let's solve the Build Binary Tree from Preorder and Inorder Traversal problem using the Tree Depth-First Search pattern.
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:
-
pOrder.length,iOrder.length iOrder.length