List vs dual-ended queues

The dual-ended queue supports thread safety, adding and removing at either end of the two ends, with a time complexity of O (1). Access to index access at both ends, with a time complexity of O (1). The time complexity of accessing intermediate elements is O (n). Random access or take a list


List: Time complexity O (n)




Implementation of the double-ended queue:
Class Deque:
# Analog dual-ended queue
def __init__ (self):
Self.items = []
def isEmpty (self):
return self.items = = []
def addfront (Self,item):
Self.items.append (item)
def addrear (Self,item):
Self.items.insert (0,item)
def removefront (self):
Return Self.items.pop ()
def removerear (self):
Return Self.items.pop (0)
def size (self):
Return Len (Self.items)

List vs dual-ended queues