what is the time and space complexity of this problem (deletion of a node in BST) with explaination
Space and time complexity?
@namangarg31 as in worst case you have to travel to the leaf node ie height therefore time complexity will be o(logn)
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.