Data structurecore
Min-max heap
Also called min-max heaps.
Binary tree whose levels alternate min and max layers, giving both extremes in O(1) to find.
Binary tree whose levels alternate min and max layers, giving both extremes in O(1) to find.
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 HGEHQG Edit this page History Report an error