binary heap

A binary heap is a data structure that organizes elements in a binary tree, where each node has a value greater than or equal to (in a max heap) or less than or equal to (in a min heap) the values of its children. It ensures efficient insertion and extraction of the minimum or maximum element.

Requires login.