## What are they?
Different binary search tree implementations, including a self-balancing one (AVL)
Binary Search Trees
TypeScript definitions for convict
A fork of `binary-search-tree` 0.2.x with upgraded dependencies from the Sails core team.
Different binary search tree implementations, including a self-balancing one (AVL)
binary search tree & avl tree (self balancing tree) implementation in javascript
Find and load configuration from a package.json property, rc file, TypeScript module, and more!
tiny binary search function with comparators
Interval search tree with TypeScript support
Better binary searching
A skip list implementation inspired by the Sorted Set in Redis.
Tree or binary tree printer, print any tree to terminal or debug window
High-performance (binary) tree and sorted map implementation (AVL, Splay, Radix, Red-Black)
Search functionality for the CodeMirror code editor
This is an implementation of the modified merkle patricia tree as specified in Ethereum's yellow paper.
Different binary search tree implementations, including a self-balancing one (AVL)
Validate an email address according to RFCs 5321, 5322, and others
Different binary search tree implementations, including a self-balancing one (AVL)
Conversion of JavaScript primitives to and from Buffer with binary order matching natural primitive order
High-performance 3D spatial index for cuboids (based on R*-tree with bulk loading and bulk insertion algorithms)
Implement search on any static website.
Implementation of interval tree data structure.
This package provides support for the [RediSearch](https://redis.io/docs/interact/search-and-query/) module, which adds indexing and querying support for data stored in Redis Hashes or as JSON documents with the [RedisJSON](https://redis.io/docs/data-type