A comprehensive JavaScript implementation of Min Heap and Max Heap data structures with practical utilities
Curated collection of data structures for the JavaScript/TypeScript.
An implementation of the Fibonacci heap data structure
Efficient Binary heap (priority queue, binary tree) data structure for JavaScript / TypeScript. Includes JavaScript methods, Python's heapq module methods, and Java's PriorityQueue methods.
binary heap (priority queue) algorithms (ported from Python's heapq module)
Min/Max Heap & Heap Sort implementation in javascript
Min Heap
Library of data structures
A small collection of useful data structures
Immutable Data Collections
javascript standard data structure library which benchmark against C++ STL
heap analysis plugins for memlab
Binary serialization of arbitrarily complex structures that sort element-wise
Programmable interface to Clinic.js Heap Profiler
javascript standard data structure library which benchmark against C++ STL
Heap dump, sample profiler and allocation timeline generator for Node.
A complete, fully tested data structure library written in TypeScript.
Parses V8 heap snapshots
asn1js is a pure JavaScript library implementing this standard. ASN.1 is the basis of all X.509 related data structures and numerous other protocols used on the web
Codecs for various data structures
[](https://www.npmjs.com/package/@smithy/types) [](https://www.npmjs.com/package/@smithy/types)
Fast heap-based priority queue in JavaScript
Production-ready TypeScript data structures: Heap, Deque, Trie, Graph, Red-Black Tree, TreeMap, TreeSet, and more. Zero dependencies, type-safe, with getRank/getByRank/rangeByRank support.
Binary serialization which sorts bytewise for arbirarily complex data structures