Data structureadvanced
Deap
Also called double-ended heap (deap).
Double-ended heap with a min side and a max side, both stored in one complete tree.
Double-ended heap with a min side and a max side, both stored in one complete tree.
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 5CWRB5 Edit this page History Report an error