An implementation of the treap data structure for node.js and the browser
Treap Data Structure
Lightweight & modular collection of data structures for TypeScript. Features Directed/Undirected Graphs, Advanced Pathfinding (Dijkstra, BFS/DFS), Randomized BST (Treap-based), and optimized presenters. Zero-dependency, ESM-first, and fully tree-shakeable
Balanced binary search tree implemented as Treaps
this package will provide a javascript implementation of randomized-binary-search-tree derived from http://kukuruku.co/hub/cpp/randomized-binary-search-trees with zero npm-dependencies
Zip Trees data structure
Randomized treap implementation
submillisecond.com cookbook recipe - data-structures: subms-treap. Probabilistic balanced BST (random priorities, heap-on-priority + BST-on-key).
Do not use - intended for internal use of teardown_tree crate
A non-randomized Treap implementation. Not very useful as a balanced tree, but useful when implementing CVM or similar algorithms.
A segment tree library enabling generic user-defined queries and actions on segments of your data.
use the CVM algorithm to quickly estimate the number of distinct elements in a stream
A binary search tree that supports fast clone and delete-range operations
A Treap-based list implementation
A collection of useful data structures.
A purely functional treap
A generic Cartesian Merkle Tree implementation
An extension to the collections in the standard library with various data structures.