Search results
41 packages found
A Javascript library for using classic Data Structures
A module to perform all the avl tree implementations using node.js.Minimizes height recursions hence faster
Fast AVL tree for Node and browser
Fast AVL tree for Node and browser
Implementation of commonly used data structures and utilities in JavaScript.
- ds
- sort map
- data structures
- JavaScript
- AVL
- AVLTree
- Trie
- TernarySearchTrie
- MultiWayTrie
- SkipList
- BTree
- BinarySearch
- BinarySearchTree
- SortedMap
- View more
AVL self-balancing binary search trees for ES6
Flexible AVL Tree for TypeScript
Native binary tree implementation baseb on GLib Balanced Binary Trees (GTree) for Node.js
A TS/JS implemenation of a self-balancing binary tree with mapped data nodes
A generic self-balancing binary tree
An AVL Binary search tree implementation in typescript.
AVL tree: a self-balancing binary search tree
Balanced binary search tree (AVL implementation)
A simple AVL Tree and Max(Min) Heap library which works in both client side and server side with no dependency
Largely copied from avl (https://www.npmjs.com/package/avl), but with a Promise-based comparator!
Javascript Abstract Data Types
It is a binary tree that is balanced automatically when node insertion or removal takes place.