Data structureadvanced
Leftist heap
Also called leftist tree, leftist heaps.
Binary heap tree that keeps the right spine short, so merge runs in O(log n).
Binary heap tree that keeps the right spine short, so merge runs 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 Z662CN Edit this page History Report an error