A heap is a complete binary tree stored in an array where every parent beats its children; it gives the largest (or smallest) item in O(1).