BaseMax/SinglyLinkedListC

This is a simple implementation of a singly linked-list in C. Singly linked-lists are a type of data structure that are used to store a collection of elements. Each element in a singly linked-list is called a node. Each node contains two parts: the data and a pointer to the next node. The first node in a singly linked-list is called the head.

Language: C - Size: 66.4 KB - Last synced at: 4 days ago - Pushed at: over 2 years ago - Stars: 0 - Forks: 0