que link:- https://hack.codingblocks.com/contests/c/511/1601
here in this que i have a doubt that for solving this problem i need a unique bst so is it possible to generate to a unique bst from a given inorder or i need to approach this que in some other way…??
Count bst subtrees that lie in given range
I guess your doubt is resolved as you have already submitted the code 
1 Like