Construct Bst From Inorder Traversal
Try First, Check Solution later1. 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).Input Format
2. Task : Construct Binary Search Tree from given InOrder Traversal.
3. you will be given an array representing a valid InOrder of a Binary Search Tree. Program is required to create a unique Balanced Binary Search Tree.
Input is managed for you.Output Format
output is managed for you.Question Video
0 <= Number of Nodes <= 10^9Sample Input
-10^9 <= value of Node data <= 10^9
Valid InOrder traversal.
1 2 3 4 5 6 7
2 -> 4 <- 6
1 -> 2 <- 3
. -> 1 <- .
. -> 3 <- .
5 -> 6 <- 7
. -> 5 <- .
. -> 7 <- .
Asked in Companies