Why does the standard library (Java/C#) not heavily feature Linked Lists? (Cache locality issues)

Although linked lists have attractive theoretical insertion and deletion complexity, real-world performance is often limited by poor cache locality, pointer chasing, object allocation overhead, and memory fragmentation. Modern CPUs process contiguous memory very efficiently, so array-backed collections frequently outperform linked lists even for workloads where both have similar asymptotic complexity.