The time required to search an element in a binary search tree having n elements is
Answers
Answered by
1
complexity is log(n) base 2
Answered by
1
log(n) base 2...........................
Similar questions