deheap

deheap - Doubly-ended heap (min-max heap) with O(log n) access to both minimum and maximum elements.

View Repository
16 Stars
2 Forks
MIT License
Go Language
2026-03-12 Last Update
0 Open Issues
data-structure deque double-ended-queue generics go golang heap heaps min-max-heap priority-queue

Related in Miscellaneous Data Structures and Algorithms

← All Miscellaneous Data Structures and Algorithms