数据结构中的队列_数据结构中的队列类型

今天药忘吃喽~ 2022-12-07 13:16 175阅读 0赞

![db083dd6bc898f7e35e32f214d1180f4.png][]

数据结构中的队列

Queue is an important structure for storing and retrieving data and hence is used extensively among all the data structures. Queue, just like any queue (queues for bus or tickets etc.) follows a FIFO mechanism for data retrieval which means the data which gets into the queue first will be the first one to be taken out from it, the second one would be the second to be retrieved and so on.

队列是用于存储和检索数据的重要结构，因此在所有数据结构中广泛使用。 队列就像任何队列(公共汽车或车票的队列等)一样，都遵循FIFO机制进行数据检索，这意味着首先进入队列的数据将是第一个要从队列中取出的数据，第二个队列是要从中取出的数据。第二个要检索，依此类推。

## 数据结构中的队列类型 **(**Types of Queues in Data Structure**)** ##

### 简单队列 **(**Simple Queue**)** ###

![simple queue][]

[Image Source][]

[图片来源][Image Source]

As is clear from the name itself, simple queue lets us perform the operations simply. i.e., the insertion and deletions are performed likewise. Insertion occurs at the rear (end) of the queue and deletions are performed at the front (beginning) of the queue list.

从名称本身可以明显看出，简单队列使我们可以简单地执行操作。 即，插入和删除同样进行。 插入发生在队列的尾部(末尾)，删除操作在队列列表的前部(开头)进行。

All nodes are connected to each other in a sequential manner. The pointer of the first node points to the value of the second and so on.

所有节点都按顺序相互连接。 第一个节点的指针指向第二个节点的值，依此类推。

The first node has no pointer pointing towards it whereas the last node has no pointer pointing out from it.

第一个节点没有指向它的指针，而最后一个节点没有指向它的指针。

### 循环队列 **(**Circular Queue**)** ###

![Circular Queue][]

[Image Source][Image Source 1]

[图片来源][Image Source 1]

Unlike the simple queues, in a circular queue each node is connected to the next node in sequence but the last node’s pointer is also connected to the first node’s address. Hence, the last node and the first node also gets connected making a circular link overall.

与简单队列不同，在循环队列中，每个节点依次连接到下一个节点，但最后一个节点的指针也连接到第一个节点的地址。 因此，最后一个节点和第一个节点也被连接起来，从而形成一个整体的环形链接。

### 优先队列 **(**Priority Queue**)** ###

![Priority Queue][]

[Image Source][Image Source 2]

[图片来源][Image Source 2]

Priority queue makes data retrieval possible only through a pre determined priority number assigned to the data items.

优先级队列只能通过分配给数据项的预定优先级编号来进行数据检索。

While the deletion is performed in accordance to priority number (the data item with highest priority is removed first), insertion is performed only in the order.

在按照优先级编号执行删除操作(优先级最高的数据项先被删除)的同时，仅按顺序执行插入操作。

### 双端队列(出队) **(**Doubly Ended Queue (Dequeue)**)** ###

![Doubly Ended Queue][]

[Image Source][Image Source 3]

[图片来源][Image Source 3]

The doubly ended queue or dequeue allows the insert and delete operations from both ends (front and rear) of the queue.

双头队列或出队允许从队列的两端(前端和后端)进行插入和删除操作。

Queues are an important concept of the data structures and understanding their types is very necessary for working appropriately with them.

队列是数据结构的重要概念，了解队列类型对于正确使用它们是非常必要的。

> 翻译自: [https://www.thecrazyprogrammer.com/2019/01/types-of-queues-in-data-structure.html][https_www.thecrazyprogrammer.com_2019_01_types-of-queues-in-data-structure.html]

数据结构中的队列

[db083dd6bc898f7e35e32f214d1180f4.png]: /images/20221123/f4a512b3d391474f9b97b1cd35d2ce50.png
[simple queue]: /images/20221123/ff1239d138ae491c9dee6f072e3a2d83.png
[Image Source]: http://scanftree.com/Data_Structure/Static-Queue
[Circular Queue]: /images/20221123/14e40b3e28ed4fb790ecc24c5da6e58e.png
[Image Source 1]: https://www.includehelp.com/ds/circular-queue-using-array.aspx
[Priority Queue]: /images/20221123/e0f7673fc91047a693bf0fdd9242a127.png
[Image Source 2]: https://www.includehelp.com/ds/implementation-of-priority-queue-using-linked-list.aspx
[Doubly Ended Queue]: /images/20221123/94317440bc1d4b94b112e8b22140f9ad.png
[Image Source 3]: http://scanftree.com/Data_Structure/duble-ended-queue-dequeue
[https_www.thecrazyprogrammer.com_2019_01_types-of-queues-in-data-structure.html]: https://www.thecrazyprogrammer.com/2019/01/types-of-queues-in-data-structure.html