Fast and memory-efficient immutable collections and helper data structures

Functional Data Structures and Algorithms in SSReflect [maintainer=@clayrat]

🌲 A C++ implementation of all functionalities (insertion, deletion, search etc) of a 2-3 (two-three) Tree using Rotation, Split and Merge operations. (Please share if you find any bug in the code)

Visualizing two three tree data structure with ImGui.

Implementation of 2-3 Trees

Implementations of AVL and 2-3 trees

A library of algorithms and data structures for the Free Pascal Compiler.

Fast persistent immutable Map data-structure for Scala with minimal memory footprint

Implementation of a 2-3 Tree

Structure and processing of 2-3-tree

My C/C++ implementation of balanced binary search tree - 2,3-tree

2-3 tree on C#

Implementation of CycleLIst, BS-tree and 2-3 tree

İTÜ BLG 335E - Analysis of Algorithms I Projects

This web-based tool visualizes the transformation of a 2-3 Tree into its equivalent Red-Black Tree. It’s designed to help students and enthusiasts understand the relationship between these two balanced tree structures through interactive graphics and real-time updates.

A B-Tree implementation of sweep line algorithm for segment intersection

No description provided.

This C++ application demonstrates the functionality of a 2-3 tree data structure. It supports dynamic insertion and deletion of elements, providing a clear illustration of balanced tree operations and node restructuring in real time.

An implementation of 2-3 tree in Rust

A C++ implementation of a 2-3 Tree data structure that strictly uses smart pointers to manage a polymorphic database of animal profiles.