LinkedList remove method

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.

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

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

public void remove ()
{
    if (getPreviousNode () != null)
        getPreviousNode ().setNextNode (getNextNode ());
    if (getNextNode () != null)
        getNextNode ().setPreviousNode (getPreviousNode ());    
}