Respuesta :
The greatest number of comparisons each operation in the method add needs, given a binary search tree with n nodes and height h, is O. (h).
What is a binary search?
Computer scientists utilize the search method known as binary search to locate a target value within a sorted array. Binary chop, logarithmic search, and half-interval search are other names for it. The binary search compares the target value to the array's center member. If not, the half where the target cannot lie is eliminated, and the search is then carried out on the remaining half while once again comparing the center element's value to the target value. Up till the goal value is found, this process is repeated. if, at the end of the search, the remaining half is empty.
To learn more about binary search from the given link:
brainly.com/question/12946457
#SPJ4
