Queues
Queues
复制标题
队列
DOI：
--
复制
发表时间：
2019
期刊：
影响因子：
--
通讯作者：
B. Upadhyaya
中科院分区：
文献类型：
--
作者：
B. Upadhyaya
队列就是一条等待的队列，它通过向尾部添加元素而增长，通过从前面删除元素而缩小。与堆栈相比，它反映了现实世界中更常用的准则，即“先到先得”。在超市、银行、食品柜台排队等候是排队的常见例子。队列作为一种数据结构的正式定义：它是一个列表，可以在一端（前端）删除条目，也可以在另一端（后端）插入条目。它也被称为先进先出（FIFO）数据结构。
A queue is simply a waiting line that grows by adding elements to its end and shrinks by removing elements from the front. Compared to stack, it reflects the more commonly used maxim in real-world, namely, “first come, first served”. Waiting lines in supermarkets, banks, food counters are common examples of queues. A formal definition of queue as a data structure: It is a list from which items may be deleted at one end (front) and into which items may be inserted at the other end (rear). It is also referred to as a first-in-first-out (FIFO) data structure.