You know, deleting an item in a linked list is just a matter of updating pointers:
- find the 'to be deleted' node.
- set the 'previous' node pointing to the 'next' (and viceversa if the list is double linked).
- release the allocated memory of the 'deleted node'.
Now the technical deatils for performing such operation depend on the list implementation.