binary heap
RU: бинарная куча
A complete binary tree kept in an array where every parent satisfies the heap order against its children. Gives O(log n) insert and extract of the extreme element, O(1) peek — the standard priority-queue backing.
RU: бинарная куча
A complete binary tree kept in an array where every parent satisfies the heap order against its children. Gives O(log n) insert and extract of the extreme element, O(1) peek — the standard priority-queue backing.