> linked lists are the default data structure underlying almost every implementation of Stacks and Queues Citation needed. I doubt this. Certainly if I had o

> linked lists are the default data structure underlying almost every implementation of Stacks and Queues Citation needed. I doubt this. Certainly if I had only ten minutes to implement a stack or a queue, without access to anything more than stdlib.h (or equivalent), a linked list is easy to get right in a hurry, and only takes a few dozen lines. But the auto-resizing array is only a little harder, and has better performance for nearly every operation, as I explained in the previous post. > they're also such a flexible data structure that it is literally the ONLY data structure necessary to implement any of the LISPs. Of course. So what? That's not a reason to use them anywhere other than a school assignment that requires you to use them.