Data structureintro
Binary heap
Also called array heap, implicit binary heap, min-heap, max-heap.
Complete binary tree stored in an array that supports insert and extract-min in O(log n).
Complete binary tree stored in an array that supports insert and extract-min in O(log n).
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag 1QKQ6A Edit this page History Report an error