Given a doubly linked list implementation, removing 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

If you are already at the node that you want to remove, then all that needs to be done is to update a few pointers.