title: Algorithm for deleting one element in an single linked list with O(1) complexity
body: <p>I'm a student of computer science in Germany. My professor gave use the following question to think about:</p>
  
  <p>'Given a reference to a node in a single linked list (which is not the last node). Give an algorithm to delete this element from the list which has O(1) complexity while maintaining the integrity'.</p>
  
  <p>I thought about this, but I'm pretty sure, that there is no such algorithm. since it is a single linked list, you must loop through every node in the list until you reach the node which should be delete, because you have to modify the next-Pointer in the node before the deleted. Which would lead to O(n) complexity.</p>
  
  <p>Am I missing anything?</p>