Singly-Linked Lists

Singly-linked lists are data strctures consisting of nodes, which hold a data value and a pointer. The pointer points to the ‘next’ element of the data structure.

The main challenge with singly-linked lists is working with the pointers, and in particular, working with pointers when adding and removing from the list.

This image might help you in your understanding of singly-linked lists:

.

Rather than write up a detailed explanation of an SLL, I have extensively commented a C++ implementation here.