Back to course home

0% completed

# Construct Binary Tree from Preorder and Inorder Traversal (medium)

**Problem Statement**

Given the preorder and inorder traversal sequences of a binary tree, your task is to reconstruct this binary tree. Assume that the tree does not contain duplicate values.

**Example Generation**

**Example 1:**

- Input:
- Preorder: [1,2,4,5,3,6,7]
- Inorder: [4,2,5,1,6,3,7]

- Expected Output:
- Tree Representation: [1,2,3,4,5,6,7]

- Justification:
- The first value in preorder (1) is the root. In the inorder list, everything left of value 1 is the left subtree and everything on the right is the right subtree

.....

.....

.....

Like the course? Get enrolled and start learning!