Consider a completely skewed (left / right) binary search tree with n elements. What is the worst case time complexity of searching an element in this tree?
Step-by-step Solution:
No explanation entered yet.