Binary search tree Packages

Binary Search Tree for browser or server

Binary search tree

Red-black tree and binary search tree

Different binary search tree implementations, including a self-balancing one (AVL)

A collection of TypeScript classes to create and use common data structures

An implementation of the Okasaki red-black tree in JavaScript

Balanced binary search tree implemented as Treaps

Javascript implementation of a binary search tree data structure

A Symbol Table implementation for JavaScript based on a Red-Black Binary Search Tree.

Package implements left leaning red black balanced search tree for symbol table key-sorted map

Binary Search Tree with Print Functionality

A sorted list using AVL the balanced binary search tree.

A collection of data structures whose traditional naming suggests they were inspired by a walk in the woods.

Data structures and algorithms written in JavaScript

A collection of data structures to use

Interval search tree

A list of common data structures implemented in Javascript

AVL Binary Search Tree implementation

Basic Dictionary ADT implementation using a Binary-Search-Tree (BST) in Javascript

specialized persistent collections in javascript -- immutable-js addons