rb-tree-multi
Red-black tree that allows duplicate keys
Red-black tree that allows duplicate keys
The JavaScript utility for creating Data Structures and perform operations on it.
High-performance (binary) tree and sorted map implementation (AVL, Splay, Radix, Red-Black)
A TypeScript library providing classic, strongly-typed data structures.
High-performance (binary) tree and sorted map implementation (AVL, Splay, Radix, Red-Black)
Data structure and algorithms implementation in Javascript
Interval search tree - this is a fork of the original project that support strings as keys.
A collection of wrappers for common data structures in TypeScript
[Fork of 'Louis Chatriot' version] Different binary search tree implementations, including a self-balancing one (AVL)
Different binary search tree implementations, including a self-balancing one (AVL)
Different binary search tree implementations, including a self-balancing one (AVL)
There are neither a lot of resources on internet nor any book which guides and dictates best practices in the implementation of popular Data Structures using Javascript. The purpose of this library is to provide cooked implementation of populare data stru
Binary search tree
A binary search tree implementation in JavaScript
Interval search tree
A fork of `binary-search-tree` 0.2.x with upgraded dependencies from the Sails core team.
Documentation app: [raikuxq-algorithms.netlify.app/guide](https://raikuxq-algorithms.netlify.app/guide)
Different binary search tree implementations, including a self-balancing one (AVL)
Different binary search tree implementations, including a self-balancing one (AVL)
JavaScript Data Structure written in TypeScript