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, 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:
-
p_order.length
,i_order.length
i_order.length