Implementation and examples of Linked List ADTs in C++, including singly, doubly, and circular variants with insertion, deletion, and traversal methods
-
Updated
Dec 10, 2025 - C++
Implementation and examples of Linked List ADTs in C++, including singly, doubly, and circular variants with insertion, deletion, and traversal methods
A repository to store my coding practice. It is mostly in C (or C++) which is just a convenient choice because I spend significant amount of time on Unix, GNU/Linux and C and C++
Este repositorio contiene múltiples ejemplos de implementación de Tipos Abstractos de Datos (ADT) para diseñar estructuras de datos eficientes y reutilizables, todos desarrollados en C++.
Reading the STL library to understand how each ADT works is a little bit hard especially if you're a junior programmer. so I decided to make a repo to rewrite the most of the ADTs as I'm learning Data strutures.
Lock-Free-Bounded-Queue
Exploring the use of recursion with the ADT Bag
Solutions to exercises from the "Algorithms & Data Structures" course at Aarhus University.
Automatic double tracking plugin (not only) for vocals
Expressive High-Performance Eager Functional Programming Library for C++ 11
This repository contains code for ADTs that I implemented in my Data Structures and Algorithms course.
C++ STL Container Implementations
This program is a website bookmarking program. The program implements a hash table using chaining (pointer array of linked lists) to store website information.
Implementing the list ADT using several data structures (dynamic array, linked list, binary search tree etc.) in C++.
Add a description, image, and links to the adt topic page so that developers can more easily learn about it.
To associate your repository with the adt topic, visit your repo's landing page and select "manage topics."