You’ll learn operations for creating a singly linked list, inserting nodes into a singly linked list, deleting nodes from a singly linked list, concatenating a singly linked list to another ...

For one thing, singly-linked lists restrict node traversal to a single direction: you can’t traverse a singly-linked list backward unless you first reverse its node links, which takes time.

The overhead is 66% for a conventional node and 50% for the pointer distance implementation. If we use multidimensional doubly linked lists, such as a dynamic grid, the savings would be even greater.