title: Efficiently search a linked list
body: <p>I have a sorted linked list, one function takes the root pointer and an Id and searches through the list to delete the item, however this takes linear time.</p>
  <p>Is there any way to efficiently search through the linked list without doing it linearly using the fact that its sorted? The assignment hints heavily that their is a better way but I can't think of a way to do it without being terribly inefficient or just using a linear search.</p>