binary max-heap

A binary max-heap is a complete binary tree where each node has a value greater than or equal to the values of its children. This data structure is commonly used to efficiently find and remove the maximum element in a set of elements.

Explore

Requires login.