Notice: This page requires JavaScript to function properly.
Please enable JavaScript in your browser settings or update your browser.
学ぶ Types of Queue | Data Structures Part I
Data Structure & Algorithms PART I

bookTypes of Queue

メニューを表示するにはスワイプしてください

In the previous chapter, we learned the queue called simple.

Let’s briefly look at other types of queues:

  • Simple queue;
  • Circular queue;
  • Priority queue;
  • Double ended queue.

Circular queue

The name of the queue tells us how it works. In a simple queue, the first customer goes home after purchasing (it is customary in real life:) ). In a circular queue, the first customer becomes the last one.

Priority queue

A priority queue is a particular type in which each element is associated with a priority and is served according to its importance.

If elements with the same priority occur, they are served according to their order in the queue.

Double-ended queue

Unfortunately, the customer waiting to pay for their purchases may become the last customer, and the lucky previous customer becomes the first in the queue.

question mark

Choose non-linear data structures.

正しい答えを選んでください

すべて明確でしたか?

どのように改善できますか?

フィードバックありがとうございます!

セクション 2.  3

AIに質問する

expand

AIに質問する

ChatGPT

何でも質問するか、提案された質問の1つを試してチャットを始めてください

セクション 2.  3
some-alt