why here bhaiya used O(lon n) for best case time complexity of BST instead of omega(log n)?
Why here bhaiya used O(lon n) for best case time complexity of BST instead of omega(log n)?
No by O here he meant that the complexity will be O(logn) even in the worst case.
we always talk about the worst case here.
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.