Heap

Материал из WikiGrapp
Перейти к навигации Перейти к поиску

Heap --- куча.

A heap is an abstract data structure consisting of a set of items, each with a real-valued key, subject to the following operations: make heap, insert(i,h), find min(h), delete min(h).

See also