Any point in using linked lists?

Except than being too lazy to use arrays? The amount of cache misses you are going to get overweights the other benefits.

>>1
Cache misses are only a problem in garbage like C, where individual nodes stay their arbitrarily allocated location and don't dynamically congregate alongside their linked neighbors across GC passes.

The advantages of linked lists outweigh the extra cache pressure. If the list is small, it's negligible. If the list is large, it'll be optimized [if it doesn't already retain certain tail-sharing advantages of its listness].