static vs dynamic data structures
The fundamental difference between arrays and linked lists is that arrays are static data structures while linked lists are dynamic data structures. A static data structure needs all of it’s resources to be allocated when the structure is created – meaning even if the structure was to grow or shrink in size and elements needed to be added or removed – it always needs a given size and amount of memory. So if more elements need to be added to a static data structure and it didn’t have that memory. you’d need to copy the data of that array and recreate it with more memory so you could add more elements to it. Whereas a dynamic data structure can shrink and grow in memory. It doesn’t need a set amount of memory to be allocated in order to exist and it’s size and shape can change – the amount of memory it needs can change as well.
FYI: this post is for my notes and learning only. I have gotten all of this awesome information from Vaidehi Joshi’s blog “What’s a Linked List, Anyway?” on her basecs Medium page.












