Traditionally, last-in-first-out data structures are called "stacks" to distinguish them from queues. In this tradition, "queue" only refers to first-in-first-out data structures.
Traditionally, last-in-first-out data structures are called "stacks" to distinguish them from queues. In this tradition, "queue" only refers to first-in-first-out data structures.