Heap

A data structure designed to efficiently find maximum or minimum values. A heap is a complete binary tree where each node's key value is either not less than its children's key values (max heap) or not greater than its children's key values (min heap). There are two types: a max heap where parent nodes always have larger key values than child nodes, and a min heap where parent nodes always have smaller key values than child nodes.