title: Time Complexity of Doubly Linked List Element Removal?
body: <p>A lot of what I'm reading says that removing an internal element in a doubly linked list (DLL) is <code>O(1)</code>; but why is this the case?</p>
  
  <p>I understand why it's <code>O(n)</code> for SLLs; traverse the list <code>O(n)</code> and remove <code>O(1)</code> but don't you still need to traverse the list in a DLL to find the element?</p>