Source: 📖 Problem Solving with Algorithms and Data Structures using Python 4.16
Date: 2021-10-29
add_front(item)
adds an item to the front of the deque.add_rear(item)
adds an item to the rear of the deque.remove_front(item)
removes and returns the item at the front of the deque.remove_rear(item)
removes and returns the item at the rear of the deque.is_emtpy()
is a boolean function that checks if the deque is empty.size()
returns the number of items in the deque.