Max-heap
= Max-heap
A <heap data structure> in which every parent key is at least as large as its children's keys. The root therefore stores a largest key, allowing a <priority queue> to retrieve a current maximum efficiently.
= Max-heap
A <heap data structure> in which every parent key is at least as large as its children's keys. The root therefore stores a largest key, allowing a <priority queue> to retrieve a current maximum efficiently.