contents: use Python deque instead of queue (#633)

This commit is contained in:
Pavel
2026-03-20 00:23:18 -05:00
committed by GitHub
parent fccbbfc755
commit 0d08a11efe

View File

@@ -40,7 +40,7 @@ Breadth-first search is commonly implemented using queues.
| --- | --- |
| C++ | [`std::queue`](https://learn.microsoft.com/en-us/cpp/standard-library/queue-class?view=msvc-170) |
| Java | [`java.util.Queue`](https://docs.oracle.com/javase/10/docs/api/java/util/Queue.html).Use [`java.util.ArrayDeque`](https://docs.oracle.com/javase/10/docs/api/java/util/ArrayDeque.html) |
| Python | [`queue`](https://docs.python.org/3/library/queue.html) |
| Python | [`deque`](https://docs.python.org/3/library/collections.html#collections.deque) |
| JavaScript | N/A |
## Time complexity