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.
But in this webpage I found that deletion an element from a linked list is: O(1).
Which one of the above big O notation is the correct one for deletion from a linked list.
The time required to remove the item from the linked list depends on how exactly we a going to do this. Here are possibilities:
In Java the last case is met when you are using