Efficient Binary heap (priority queue, binary tree) datastructure for JavaScript / TypeScript. Includes JavaScript methods, Python's heapq module methods, and Java's PriorityQueue methods.
An implementation of the Fibonacci heapdatastructure
Min/Max Heap & Heap Sort implementation in javascript
Classical implementation of binary heapdatastructure