Construct Binary Tree From Inorder And Preorder

Asked in:
Amazon
Microsoft

Problem Description

Given preorder and inorder traversal of a tree, construct the binary tree.
Note: You may assume that duplicates do not exist in the tree.

Problem Constraints

1 <= |A| <= 10⁵
|A| == |B|

Input Format

The first argument is an integer array A representing the preorder traversal.
The second argument is an integer array B representing the inorder traversal.

Output Format

Return the pointer to the root node of the tree.

Example Input

Preorder : [1, 2, 3]
Inorder  : [2, 1, 3]

Example Output

            1
           / \
          2   3

NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a question? Checkout Sample Codes for more details.

Start solving Construct Binary Tree From Inorder And Preorder on Interview Code Editor

Hints

Hint 1
Solution Approach
Complete Solution

Asked In:

Amazon
Microsoft

Construct Binary Tree From Inorder And Preorder

Discussion