In computer science, an addressable heap is an abstract data type.
Specifically, it is a mergeable heap supporting access to the elements of the heap via handles (also called references).
It allows the key of the element referenced by a particular handle to be removed or decreased.
An addressable heap supports the following operations:[1] Examples of addressable heaps include: A more complete list with performance comparisons can be found here.