Python Deque Data Structure

Choose another application of your interest to demonstrate Deque abstract data structure mechanism. You should not implement a palindrome checker.

class Deque:

def __init__(self):

self.elements = []

self.front = -1 # points the beginning of a queue

self.rear = 0 # points end of a queue

# Inserts element at the Front

def insert_front(self, element):

self.elements.insert(0, element)

# Inserts element at the rear

def insert_rear(self, element):

self.elements.append(element)

# Removes element at the front

def remove_front(self):

return self.elements.pop(0)

# Removes at the rear

def remove_rear(self):

return self.elements.pop()

# Returns size of a queue

def size(self):

return len(self.elements)

# Returns True if deque is empty, otherwise returns false

def is_empty(self):

return self.elements == []