30, 20, 10 years ago. Or never. Linux continues to use RB Trees for a huge number of its processing. Because its faster to keep a tree sorted than to sort arra

30, 20, 10 years ago. Or never. Linux continues to use RB Trees for a huge number of its processing. Because its faster to keep a tree sorted than to sort arrays. You talk as if linked data-structures are inferior or something. Rather than different. Now yes, linked data-structures get relatively worse when latency remains the same but CPU GHz gets faster, but then the reverse is true when cache sizes get larger. L3 caches are now 192MBs on some processors, while Intel consistently has been pushing 1MB+ L2 caches with full load/store bandwidth per core. There is a time and place for all techniques. Including linked data-structures / cons / list-processing.