This library provides advanced implementation of Red-black tree, which is a kind of self-balancing binary search tree for JavaScript
Basic Dictionary ADT implementation using a Binary-Search-Tree (BST) in Javascript
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.
The repo is holds a list of 300k english letter already formatted as tree and available fo
An implementation of a binary search tree API in JavaScript