Skip to content

Glossary: Data Structures and Algorithms in Go

Max-heap

Also written: max heap

A heap that pops the biggest item first. You make one by flipping `Less` to use `>`.

Where the book teaches it

Related terms

HeapPriority queue