my code is giving correct ans but not passing the test cases. please tell me how to correct my code and which corner case i am missing
Not passing the test case
@shivamgoel150 you haven’t built a BST, you built a normal binary tree. Output of the “range” part is also not correct (in a BST inorder traversal gives ascending order)
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.