Building a stack and converting it to a deque [RU]
-
Updated
Jun 18, 2017 - C
Building a stack and converting it to a deque [RU]
In computer science, a double-ended queue (abbreviated to deque) is an abstract data type that generalizes a queue, for which elements can be added to or removed from either the front (head) or back (tail).
Simple implementation of a double-ended queue in C
Implementation of a DoubleEndedList for Julia
A semester tasks of Data Structure and Programming Fundamentals using C++ Language.
Implementation of a customer complaint queue for the service department system to handle angry customer's complaints.
Double-ended priority queues
Implementation of different types of Queues, viz. linear queue, priority and double-ended queue.
Various Data Structures implemented in C programming language.
Doubly ended heap
Repository for Data Structures and Algorithms in Python.
Vehicle field test application support and more.
Basic algorithm and Datastructres
A simple, generic and thread-safe deque implementation
Double-ended queue for .NET 🔁
Repositório dedicado ao estudo de utilização de listas dinâmicas com interfaces pré-montadas em Java, para que o usuário não necessite saber das implementações para utilizar as listas.
Add a description, image, and links to the double-ended-queue topic page so that developers can more easily learn about it.
To associate your repository with the double-ended-queue topic, visit your repo's landing page and select "manage topics."