Heap

In computer science, a heap is a tree-based data structure that satisfies the heap property: In a max heap, for any given node C, if P is the parent node of C, then the key of P is greater than or equal to the key of C. In a min heap, the key of P is less than or equal to the key of C. The node at the "top" of the heap is called the root node.

Back to Data Structures →

Source: Wikipedia · Image: Wikimedia Commons · CC BY-SA 4.0

ALGOHAY

Algorithms, demystified — data-structure guides, complexity tools, and interview prep for developers.

Get new guides by emailOccasional emails. No spam. Unsubscribe anytime.

InformationAbout Contact Privacy Policy Terms of Service Disclaimer Affiliate Disclosure Cookie Policy

Every algorithm, image, fact, and figure in the museum is drawn from Wikipedia and Wikimedia Commons, used under public-domain and Creative Commons licenses. No content is AI-generated.