Why is a binary search operation impractical for a reference-based implementation of the ADT table?

What will be an ideal response?

There is no straightforward way to go halfway between two elements (in a linked list) as we can with arrays.