Free preview
Linked Lists
Nodes chained by pointers: O(1) splice anywhere, O(n) search and no random access, and how embedded does them without a heap via static node pools and intrusive lists.
25 min read
This lesson is part of Pro
Upgrade to unlock the full lesson, every coding problem, and the complete interview Q&A.
Unlock with ProThis is just the start
Sign up free to track progress on this lesson, get coding problems with the Run button, and unlock the full interview Q&A.
More in Data Structures & Algorithms
Time & Space ComplexityArrays & Memory LayoutRing Buffers
Stacks & Queues
Hash Tables
Static vs Dynamic Allocation