×

What is the time complexity of searching for an element in a balanced binary search tree?

What is the time complexity of searching for an element in a balanced binary search tree?

متوازن بائنری سرچ ٹری میں کسی عنصر کی تلاش میں وقت کی پیچیدگی کیا ہے؟
Explanation
  • In a balanced binary search tree, the height is proportional to log n, ensuring efficient searches.
  • The time complexity is O(log n) as the search halves the tree at each step.