p-queue-ts

Minimalist priority queue implementation using a binary heap, written in TypeScript. Version 1.2.0 ships with type definitions and supports both max-heap (default) and min-heap via custom comparator. The library is small (under 1KB gzipped), has zero dependencies, and targets Node >=8. It provides a basic API (push, pop, top, size) common to LeetCode-style problems. Compared to alternatives like @datastructures-js/priority-queue or js-priority-queue, this package is simpler and less feature-rich, but it remains actively maintained as of 2025.