singly linked list

A linked list in which each node points only to the next node, so it can be walked in one direction.

In more detail

Deleting a node requires its predecessor, because that is the node whose next pointer must change. Pushing to the front is O(1); appending is O(1) only if you also keep a tail pointer. The course's SLL class implements push-front, append, delete and find.

Related terms

Taught in

References