A highly optimized double-ended queue

🎀 Just the cutest and tiniest queue/deque implementation!

Generic double-ended heap (min-max heap) for Go — O(1) min and max, O(log n) push/pop

Various containers written for C programmers who need complete control over their memory.

Repository for Data Structures and Algorithms in Python.

Double-ended priority queues

A simple, generic and thread-safe deque implementation

Vehicle field test application support and more.

Double-ended queue for .NET 🔁

This repository provides Java code implementations for various data structures and algorithms. It's a great resource for learning and practicing DSA concepts in Java.

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.

Implementation of different types of Queues, viz. linear queue, priority and double-ended queue.

Simple implementation of a double-ended queue in C

Implémentations de divers structure de données en Java

Various Data Structures implemented in C programming language.

Building a stack and converting it to a deque [RU]

A semester tasks of Data Structure and Programming Fundamentals using C++ Language.

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).