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

Contenu du cours

Data Structure & Algorithms PART I

Data Structure & Algorithms PART I

1. Introduction to ADS
2. Data Structures Part I
3. Trees Part I
4. Trees Part II

book
Types 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.

Select the correct answer

Tout était clair ?

Comment pouvons-nous l'améliorer ?

Merci pour vos commentaires !

Section 2. Chapitre 3
Nous sommes désolés de vous informer que quelque chose s'est mal passé. Qu'est-il arrivé ?
some-alt