Linked Lists offer $O(n)$ insert and removal at any position, $O(1)$ list concatenation, and $O(1)$ access at the front position (and the back, in the case of doubly-linked lists) as well as $O(1)$ next element access. This makes them ideal for sequential operations (and recursive functions operating on sequential data); indexed data structures (e.g. maps, vectors, arrays) can only offer $O(log \space n)$ speed.