Question
What is the time complexity for searching an element in a binary search tree?
A) O(log n)
B) O(n)
C) O(n log n)
D) O(1)
A) O(log n)
B) O(n)
C) O(n log n)
D) O(1)
Answers
GPT 3.5
A) O(log n)