Queue in Python

Deque advantages

Report a typo

What are the advantages of deque from the collections module being implemented as a doubly linked list?

Select one option from the list

Each element stores references to the previous and next ones, so we can access them quickly.

Its elements are compressed, so we can quickly access them.

Only small number of elements are stored together in memory, so append and pop can be performed quicker.

Elements are unique, so the size of the deque is small

___

Create a free account to access the full topic