Data structureresearch
Hollow heap
Also called hollow heaps.
Simple heap with O(1) worst-case insert and decrease-key and O(log n) amortized delete.
Simple heap with O(1) worst-case insert and decrease-key and O(log n) amortized delete.
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 AQJK5W Edit this page History Report an error