A C++ STL-compatible memory allocator (buffer manager)
-
Updated
Oct 21, 2025 - C++
A C++ STL-compatible memory allocator (buffer manager)
Persistent key-value store database library.
Repositório com exercícios feitos na disciplina Estrutura de Dados II
Binary balanced search tree: AVL, red-black tree recursive/non-recursive C++ code implementation (non-third-party library)
This folder contains some efficient sorting algorithms (Counting Sort, Quicksort, Select), Trees (BST, RBT, AVL), Heap (Max Heap), Make-Union-Find (with and without Union By Rank) and an Hashing function example.
1.算法与数据结构库;2.已经实现动态数组/双向链表/栈/队列/堆/链式哈希表/二叉搜索树/红黑树.均以C++模板类实现,可用于实际项目中替代STL的容器类及数据结构学习.3.已经实现图/深度优先/广度优先/单源最短路径/所有结点对最短路径/最小生成树/快速排序/归并排序/字符串匹配算法.可用于实际项目及算法学习.4.对分治/迭代算法设计方法进行总结,对动态规划/贪心算法针对几个经典问题做了具体实现.
🔧⚙️ In this project, I will repeat the work of standard containers from C++
Data structure implementation
Implementation of Red Black Tree and min heap for city construction
This includes various algorithm paradigms and data structures in C++
A STL library with data structures and algorithms implemented in pure C++11.
Add a description, image, and links to the rbtree topic page so that developers can more easily learn about it.
To associate your repository with the rbtree topic, visit your repo's landing page and select "manage topics."