Cacher is the code snippet organizer for pro developers

What do we want to do with a single linked list?

1. Create a linked list when it doesn't already exist.
2. Search through a linked list to find an element.
3. Insert a new node into the linked list.
4. Delete a single element from a linked list.
5. Delete an entire linked list.

The operation for "Delete a single element from a linked list" is quite difficult to do in Singly Linked Lists. Because it requires to get the pointer information of the previous node, but singly linked lists don't provide a way to go backwards. So double linked lists would be better for doing this.