Tag
pointers
- Oct 21, 2026 Singly Linked Lists: One Pointer per Node and the Cost of Unidirectional Traversal How a head pointer and a next field support O(1) splicing, why deletion needs the predecessor, and what pointer chasing costs on a modern cache hierarchy. data structures
- Jun 1, 2026 XOR Linked Lists: One Link Field for Both Directions Storing the difference of the two neighbour addresses halves link storage and forces traversal to carry two cursors, which breaks under debugging tools and section boundaries. data structures
- May 29, 2025 Skip Lists: Express Lanes over a Sorted Chain Layered forward pointers turn a linear scan into an expected O(log n) search, and the geometric level distribution is what makes the expected bound hold without rebalancing. data structures
- Mar 20, 2024 Doubly Linked Lists and the Sentinel Header That Removes the Null Checks Why two pointers buy constant-time removal from a node alone, how a circular sentinel collapses the special cases, and what the extra word per node costs. data structures
- Apr 27, 2023 Intrusive Linked Lists: Embedding the Link in the Payload How intrusive chains eliminate per-element allocation and let one object sit on several lists at once, at the cost of type knowledge and ownership rules. data structures