In the worst case, a general binary search tree could require __________________ comparisons to find an element.
a) O(1)
b) O(n)
c) O(2 n )
d) O(log 2 n)
e) none of the above
b) O(n)
Computer Science & Information Technology
a) O(1)
b) O(n)
c) O(2 n )
d) O(log 2 n)
e) none of the above
b) O(n)