min-heap

A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children. It is used to implement the priority queue data structure efficiently.

Requires login.