Data structurecore
Banker's queue
Also called Okasaki banker's queue, batched queue, two-list queue.
A persistent queue of two lists where a batched reversal gives amortized O(1) bounds that break under persistent reuse.
A persistent queue of two lists where a batched reversal gives amortized O(1) bounds that break under persistent reuse.
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 WBJ0ZE Edit this page History Report an error