Grokking the Behavioral Interview
Get Educative’s popular interview prep course for free.
Arrays and Linked Lists are two of the most popular linear data structures. Let’s look at some of their major differences:
The entire array is stored in a contiguous block of memory.
Different elements are stored at different memory locations.
The size of an array is specified at the time of declaration and cannot be changed afterward.
Data items can be added or removed from the linked list whenever desired.
Due to contiguous allocation, an array can only be stored where there is a large block of free space is available.
Different elements are stored at different locations; hence, linked lists can be made within small chunks of free space.
Space consumption is overall less.
Space is required to store pointers next to nodes.
Any element can be directly indexed in worst-case time.
The list needs to be traversed from the first element up to the required element, taking worst-case time.
Linear search and Binary search (if sorted).
Linear search only.