Groups
Category
Level
A kinetic tournament tree maintains the minimum (or maximum) of moving values whose pairwise order can change over time.
A priority queue returns the highest-priority element first and is efficiently implemented by a binary heap.