Fast sorted collections for Swift using in-memory B-trees

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

🌿 Data structures for JavaScript

🔗 Common Data Structures and Algorithms

An on-disk, Codable R*-Tree for Swift

A Java implementation of the Trie data structure

ConcurrentSortedDictionary implementation in (c#, .NET 7) . It is implemented using a concurrent B+Tree

This is the implementation of 2nd Part in 3-Part Series of Algorithms Illuminated Book. All Implementations in this repository are written in both Python and Golang. Single IPython Notebook contains all Algorithms given in this Part 2.

A Codable, On-Disk B-Tree

Single-header C++11 implementation of the Cache Sensitive Search tree (CSS-tree)

🌲 Persistent data structures for JavaScript

Logic Programming using Prolog.

Tree data structures for PHP – containing general tree, binary tree, and AVL tree

Visualisation for traversing a search tree, made in Godot 4

Purely functional data structures

An AVL tree implementation in Rust.

Generic B-Tree

A static RTree implementation for Grasshopper

Learned Data Structures and Algorithms: Basic Programming Constructs, Data types, Search trees, Hashing, Complexity Analysis, Algorithm design, Graph algorithms, Sort algorithms

🎄 Red-black tree library for JavaScript