Binary heaps and priority queues
A binary max heap stores a complete binary tree in an array with every parent key at least its children's keys.
Key knowledge
A binary max heap stores a complete binary tree in an array with every parent key at least its children's keys. Maximum lookup is O(1); upward/downward restoration after insertion or extraction costs O(log n), and bottom-up heap construction costs O(n).
Conditions and scope
- The heap order does not sort all keys.
- Use the analogous reversed comparisons for a min heap.
Sources · 1
References
Sources retain their recorded scope. A source link alone does not establish verification of every statement.
Evidence and review
Lecture 8 heap property, heapify operations and linear build analysis.
2026-10-10 · Independent AI editorial review: All241 compact claims, hypotheses, displayed equations/conventions and all596 origin semantic links read; entire241-entry author exact-source inspection matrix and declared limitations reviewed. Prior105 actual inherited Mathematics/Information records read for whole-inventory breadth. Targeted independent primary sections are listed below; this does NOT claim every cited source body or every proof was independently re-read. This is AI reference-content review, not human disciplinary certification, exhaustive textbook reproduction or experimental replication. Receipt: mathematics-information-independent-content-review.1.
Entry details
Permanent link to this entry ↗- Record identity
- info-binary-heaps
- Revision
- university-core.1
- Structured reference record
- University core expansion