The Nested Containment List for Python. Basically a static interval-tree that is silly fast for both construction and lookups.

A generic interval tree implementation in C#

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

Library which contains several time-dependent data and index structures (e.g., IntervalTree, BucketTimeSeries), as well as algorithms.

An Interval Tree data structure.

A C++ header only interval tree implementation.

Rust implementation of a fast, easy, interval tree library nim-lapper

Golang generic Interval Search Tree

A red-black self-balancing interval tree

Fast interval intersection library

The esa-matchfinder is a C99 library for efficient Lempel-Ziv factorization using enhanced suffix array (ESA).

Augmented Interval Tree implemented in Cython/C

Implementation of self balancing binary search tree data structure called Red-Black Tree. Based on interval tree described in "Introduction to Algorithms 3rd Edition", published by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein.

Data Structures and Algorithms

Advance algorithm implementations

tree for float intervals

BST, Red-Black-Tree & Interval Tree in Golang

🌲 Improved Interval B+ tree implementation, in TS 🌲 https://edgaracarneiro.github.io/I2Bplus-tree/

C++ implementations of real time dynamic planar convex hull construction algorithms.

python3 implementation of trees. Including AVL Tree, Interval Tree and More.