Re: binary search

It is not a homework problem rather an interview question. I searched
google and got one solution wherein they kept additional pointers that
points to the node in the middle, a decision is made at the first node
to find out if we need to check the first or the second half of the
linked list and the same is continued with each half-list.
However it incurs some inefficiency because we always need to keep
track of the middle element in the list.

.