I did this problem using auxilary vector and creating a new tree but could you suggest any other efficient approach ???
Increasing order search tree
hello @coderajay03 dont think about trying to do all the appraoches.
your main aim should be to able to solve the question.
and you can see about the implementation in discussion section.
Happy Learning !!
okay so my question is now do without using O(n) space or in constant space and If I have leetcode discussion what was the need of purchasing this course ?
have you submitted the code ?
or you are facing problem in wriitng the code ?
yes I submitted the code but LEETCODE accepts all type of solutions whether they are efficient or not . And I did that in O(n) space complexity now I am asking is their and efficient approach to do it???
what is the time complexity?
have you heard about time space trade off if you want to optimise your space complexity then for sure your time complexity will increase this is what meant by time space trade of you have to trade between the time and space.
i dont think you can reduce the space complexity.
1 Like
okay if that’s the case thankyou bhaiya !!!
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.