Remove paragraph about inefficiency of lists used as queues now that the example uses deque.
diff --git a/Doc/tutorial/datastructures.rst b/Doc/tutorial/datastructures.rst
index 2f94885..dfc2b33 100644
--- a/Doc/tutorial/datastructures.rst
+++ b/Doc/tutorial/datastructures.rst
@@ -158,11 +158,6 @@
>>> queue # Remaining queue in order of arrival
deque(['Michael', 'Terry', 'Graham'])
-However, since lists are implemented as an array of elements, they are not the
-optimal data structure to use as a queue (the ``pop(0)`` needs to move all
-following elements). See :ref:`tut-list-tools` for a look at
-:class:`collections.deque`, which is designed to work efficiently as a queue.
-
.. _tut-functional: