1 paper
Dariusz Dereniowski, Izajasz Wrosz
We consider the following generalization of binary search in sorted arrays to tree domains. In each step of the search, an algorithm is querying a vertex q, and as a reply, it re…