Peter Hansen <peter at engcorp.com> writes: > Checking the source, Queue is implemented as a sophisticated wrapper > around a standard Python list []. That means adding an item is > amortized O(1), while removing one is O(n). Why is removing one O(n)? That should be easy to fix, if true.