if you are conducting a binary search through a tree that holds student objects, and you are trying to find out whether a student with a certain id exists in the data set, what must be true in order for this search to be able to be performed in o(log n) time?