Construct Bst From Postorder Traversal
1. You are given a partially written function to solve(Refer question video). 2. Task : Construct Binary Search Tree from given PostOrder Traversal. 3. you will be given an array representing a valid PostOrder of a Binary Search Tree. Program is required to create a unique Binary Search Tree.
0 <= Number of Nodes <= 10^9 -10^9 <= value of Node data <= 10^9 Valid PostOrder traversal.
Input is managed for you.
Output is managed for you.
6 1 2 6 7 5 3
2 -> 3