Data Structures · topic
Singly, doubly and circular lists: insertion and deletion with safe pointer order, costs with and without a tail pointer, sentinel nodes, reversal, middle node, Floyd cycle detection with cycle start and length, merging sorted lists, and list questions with compiled C.
A linked list stores a sequence as separate nodes, each holding an element and a pointer to the next node. Unlike an array, the nodes need not be contiguous, the length can change one node at a time, and inserting or deleting at a known position needs no shifting.
One-page visual sheets for this topic, in the sheet library on the store. Previews are free; the full sheets come with the subject pack.
