Construct Bst From Inorder Traversal
1. You are given a partially written function to solve(Refer question video). 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.
0 <= Number of Nodes <= 10^9 -10^9 <= value of Node data <= 10^9 Valid InOrder traversal.
Input is managed for you.
output is managed for you.
7 1 2 3 4 5 6 7
2 -> 4