You are missing a lot, mostly in the actual time it takes to do certain operations like heap allocations or traverse a linked list with lots of pointer chasing.

Linked lists are much more efficient for indeterminate stacks/queues because the memory can be anywhere and paged by the OS as needed.

Memory being anywhere isn't an advantage. Dereferencing a pointer whose memory is not anywhere in cache (and whose page is not in the translation look aside buffer) can be 300x the time it takes to look up the next few bytes in memory sequentially (due to prefetching).

Also "paged by the OS as needed" has basically no relevance here, since that would refer to virtual memory being transparently mapped to a file in a file system.

To make this more concrete, if there is a stack or queue that heap allocates every item and links it with a pointer from the previous item, even though you don't have to run through the entire list, you are still doing heap allocations every time instead of just decrementing from an index and leaving the space allocated, which is trivial to do with a vector. In more extreme situations you could use large chunks that get linked together to have a more hybrid approach with neither of the extremes. This is what std::deque does in C++, which is also used as the storage for std::stack by default.

https://en.cppreference.com/w/cpp/container/deque