Data structurecore
Queue with minimum
Also called Queue with minimum (Minimum Queue).
A queue that returns its current minimum in constant amortized time, built from two minimum stacks or a monotonic deque.
A queue that returns its current minimum in constant amortized time, built from two minimum stacks or a monotonic deque.
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 VVXG5M Edit this page History Report an error