Mention inefficiency of lists as queues, add link to collections.deque discussion.
diff --git a/Doc/tutorial/datastructures.rst b/Doc/tutorial/datastructures.rst
index a56fd2b..669dfc4 100644
--- a/Doc/tutorial/datastructures.rst
+++ b/Doc/tutorial/datastructures.rst
@@ -154,6 +154,11 @@
>>> queue
['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: