In this presentation, we covered: Dealing with node-based allocation with arrays; internally, it is still a linked list, only the nodes are contiguous in memory; it is no longer necessary to call the operating system for each new node; doubling the memory used is straight-forward; to halve the memory used, we just follow the linked list. | Lecture Algorithms and data structures Chapter 14 - Linked List Traversal Inserting