A fully persistent balanced binary search tree
A fully persistent balanced binary search tree. Typed version
Library of associative containers; it implements TreeMap, TreeSet, TreeMultiMap and TreeMultiSet classes
A simple left leaning red black tree implementation.
Observable binary tree data structures for CanJS
Balanced interval tree
Interval tree data structure implementation.
A Red-Black Tree with a generic interface for TypeScript
A collection of data structure models