# Construct Binarytree From Preorder And Inorder Traversal

#### Try First, Check Solution later

1. You should first read the question and watch the question video.
2. Think of a solution approach, then try and submit the question on editor tab.
3. We strongly advise you to watch the solution video for prescribed approach.

`1. You are given a partially written function to solve(Refer question video).2. Task : Construct Binary Tree from PreOrder and InOrder Traversal.3. you will be given two arrays representing a valid PreOrder & InOrder of a Binary Tree. Program is required to create a unique Binary Tree.`
Input Format
`Input is managed for you.`
Output Format
`Output is managed for you. `
Question Video
Constraints
`0 <= Number of Nodes <= 10^9-10^9 <= value of Node data <= 10^9Valid InOrder & PreOrder traversals.`
Sample Input
`74 2 1 3 6 5 71 2 3 4 5 6 7`
Sample Output
`2 -> 4 <- 61 -> 2 <- 3. -> 1 <- .. -> 3 <- .5 -> 6 <- 7. -> 5 <- .. -> 7 <- .`

• Asked in Companies
• Related Topics

Run

Run
Id Name