Given a linked list implementation, deleting the current element takes how long in the average case?

\Theta(1) time
  • \Theta(n) time
  • \Theta(\log n) time
  • \Theta(n \log n) time

Normally in a linked list, the bottleneck is reaching the node in question.

If we are already at the node that we want to delete, then its just a couple of changes to make to delete the node.