big O notation for removing an element from a linked list
<p>I was reading about linked lists. I found that : Removing an desired element from a linked list takes O(n) running time, where n is the number of
elements in the list. 
<a href="http://www.cs.mcgill.ca/~dprecup/courses/IntroCS/Exams/comp250-final-2006-solutions.pdf" rel="nofollow noreferrer">http://www.cs.mcgill.ca/~dprecup/courses/IntroCS/Exams/comp250-final-2006-solutions.pdf</a></p>

<p>But in this webpage I found that deletion an element from a linked list is: O(1).
<a href="http://bigocheatsheet.com/" rel="nofollow noreferrer">http://bigocheatsheet.com/</a></p>

<p>Which one of the above big O notation is the correct one for deletion from a linked list.</p>

<p>Thanks</p>