Queue in Python

Time complexity

Report a typo

What time do operations append() and pop() take on a dequeue? Why?

Select one option from the list

Constant time because each chunk of elements stores the references to the previous and to the next one.

Quadratic time because we first need to find a place to store an element and then move all other elements by one.

Constant time because pointers to the both ends of a doubly-linked list are stored.

Linear time because each element contains a reference to the next element.

Create a free account to access the full topic