An intrusive C++17 implementation of a Red-Black-Tree, a Weight Balanced Tree, a Dynamic Segment Tree and much more!

Demystifying Red Black Trees

A C++ header only interval tree implementation.

Fast spatio-temporal system to index events.

Implementation of lock-free red-black tree using CAS

A red-black self-balancing interval tree

Stop printing your tree the ugly way.

Persistent red-black tree in C++

Fortune's algorithm for Voronoi diagram generating on the plane. Intended for runtime speed and careful handling of corner cases.

C++ Implementation of Zip Trees

Examples of intrusive container templates in C++.

Multifunctional tree visualizer that with implementation of red-black, avl, splay trees and treap

A repository for uploading exercises from the FMI SDA (Data Structures and Algorithms) Course 2023-2024.

A proof of concept implementation of a Key Value Store using an LSM-Tree with benchmarks against RocksDB.

Generic red-black tree implementation for self-balancing binary search trees

Insertion Sort, Quick Sort, Merge Sort, Min Heap, Priority Queue, Red Black Tree, Order Statistic Tree, Graph Creation, Breadth-First and Depth-First Search and Homework Assignments

Implementation of a self-balancing binary search tree.

Some advanced data structures' implementations in C++

红黑树实现/Red-Black-Tree

赤黒木(red black tree/rb_tree)をダンプ表示する