A linear data structure where elements (called nodes) are stored in sequence, but unlike arrays, each element contains data and a reference (link) to the next element's location in memory. Elements don't need to be stored in consecutive memory locations.
Compound term from 'linked' (connected) and 'list' (sequence). Developed in the 1950s by computer scientists who needed a way to create lists that could grow and shrink dynamically, unlike fixed-size arrays. The 'linking' refers to pointers connecting the elements.
A linked list is like a treasure hunt where each clue (node) contains both a piece of treasure (data) and directions to find the next clue (pointer). You have to follow the chain from beginning to end - you can't jump directly to clue #5 without following clues 1, 2, 3, and 4 first!
Complete word intelligence in one call. Free tier — 50 lookups/day.