Prefix-tree Packages

Trie and radix tree implementation tailored towards exact matches.

Radix tree based routing for Koa 2.x

Data Structures of Javascript & TypeScript. AVLTree, Binary Search Tree, Binary Tree, Tree Multiset, Graph, Heap, Priority Queue, Linked List.

A serializable compact prefix trie

Standard data structure

Trie, Prefix tree. Javascript & Typescript Data Structure.

A JavaScript package for implementing the Trie data structure, including essential methods for efficient data retrieval.

Zero dependency, type-safe implementation data structure that mixes the properties of a radix tree and a BK-Tree.

Simple, zero dependency, type-safe implementation of a radix tree data structure.

Simple, zero dependency, type-safe implementation of a trie data structure.