2.0 KiB
Linked Lists
Arrays store elements in contiguous memory locations, resulting in easily calculable addresses for the elements stored and this allows faster access to an element at a specific index. Linked lists are less rigid in their storage structure and elements are usually not stored in contiguous locations, hence they need to be stored with additional tags giving a reference to the next element. This difference in the data storage scheme decides which data structure would be more suitable for a given situation.
Free Content Linked List Data Structure | Illustrated Data Structures Linked Lists in 4 minutes Singly Linked Lists CS 61B Lecture 7: Linked Lists I CS 61B Lecture 7: Linked Lists II Core: Linked Lists vs Arrays In the Real World: Linked Lists vs Arrays Why you should avoid Linked Lists? Doubly Linked Lists