by keeping track of a candidate element that *might* be equal to the query element
and checking for equality only when you hit the bottom of the tree.