Does the find and add operations on a binary search tree always require at most O(log₂ n) comparisons? If so, why? If not, why not?

Name: Does the find and add operations on a binary search tree always require at most O(log 2 n) comparisons? If so, why? If not, why not?
Brand: Quizplus
Rating: 5.0 (28 reviews)

Question

Quizplus · Accepted Answer

The Answer of Does the find and add operations on a binary search tree always require at most O(log₂ n) comparisons? If so, why? If not, why not?

Does the Find and Add Operations on a Binary Search