LinkedList remove method

Question

What is a doubly linked list's remove method?

Answer 1

The same algorithm that Bill the Lizard said, but in a graphical way :-)

_{(source: jaffasoft.co.uk)}

Answer 2

The general algorithm is as follows:

• Find the node to remove.
• node.previous.next = node.next
• node.next.previous = node.previous
• node.previous = null
• node.next = null
• Dispose of node if you're in a non-GC environment

You have to check the previous and next nodes for null to see if you're removing the head or the tail, but those are the easy cases.