heap-data-structure/binomial-heap

This project provides binomial heap data structures for JavaScript, offering both standard and lazy variants with optional parent pointers. It's designed for developers needing efficient priority queue implementations in their applications, particularly those working with algorithms that require mergeable heaps.