priority queue

RU: очередь с приоритетом

An abstract data type that stores elements and allows extraction of the element with the highest priority (lowest value in a min-heap, highest value in a max-heap). Common operations: insert(x), extractMin(), peek(), isEmpty().