Pro lesson · 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 and the complete interview Q&A.
Unlock with Pro5 interview questions on this topic
Each one opens a full worked answer.
What's the fundamental tradeoff between a linked list and an array?How do you use linked lists on a system with no heap?Can you delete a node from a singly linked list in O(1)?Why might a linked list be slower than an array even when Big-O says they're equal?What's an intrusive linked list and why is it favored in embedded/kernel code?
This is just the start
Sign up free to track your progress through this course, mark lessons complete, and work through the full interview Q&A.
More in Data Structures & Algorithms
Time & Space ComplexityArrays & Memory LayoutRing Buffers
Stacks & Queues
Hash Tables
Static vs Dynamic Allocation