deheap

github.comtool

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

from

Go

added

2026-10-10

likes

0

Go › Data Structures and Algorithms > Queues: “Doubly-ended heap (min-max heap) with O(log n) access to both minimum and maximum elements.”