@subspace/red-black-tree
This library provides advanced implementation of Red-black tree, which is a kind of self-balancing binary search tree for JavaScript
This library provides advanced implementation of Red-black tree, which is a kind of self-balancing binary search tree for JavaScript
This module aims to provide a full suite of abstract data types. At present it provides the abstract data type, Queue, Linked List, Stack, Binary Tree an Binary Search Tree.
Makes an auxilary tree structure to get O(m) efficient autocomplete results, (where m is the length of a search string), without use of external dependencies.<br /> The repo is holds a list of 300k english letter already formatted as tree and available fo
Red-black tree and binary search tree
Trie generator.
Basic Dictionary ADT implementation using a Binary-Search-Tree (BST) in Javascript
An implementation of a binary search tree API in JavaScript