structural:summarization
Singly linked list

Singly linked lists contain nodes which have a 'value' field as well as 'next' field, which points to the next node in line of nodes. Operations that can be performed on singly linked lists include insertion, deletion and traversal.

The following C language code demonstrates how to add a new node with the "value" to the end of a singly linked list: