deque.py

class Deque:

    def __init__(self):
        self.len=0
        self.deque = []

    def empty(self):
        if self.len == 0:
            return True
        return False

    def push_front(self, e):
        self.deque.insert(0, e)
        self.len += 1

    def push_back(self, e):
        self.deque.insert(self.len, e)
        self.len += 1

    def pop_front(self):
        if not self.empty():
            self.deque.pop(0)
            self.len -= 1
            return print('Adicionado')
        return print('Não foi possvel adicionar o valor. \
        Deque Vazio')

    def pop_back(self):
        if not self.empty():
            self.deque.pop(self.len - 1)
            self.len -= 1
            return print('Adicionado')
        return print('Não foi possvel adicionar o valor. \
        Deque Vazio')

    def length(self):
        return self.len

    def front(self):
        if not self.empty():
            return self.deque[0]
        return print('Sem elementos')

    def back(self):
        if not self.empty():
            return self.deque[-1]
        return print('Sem elementos')

    def show(self):
        for i in self.deque:
            print(i, end=' ')

d= Deque()
#print(d.show())
#print(d.back())
#print(d.front())
print(d.pop_back())
d.push_back(1)
print(d.push_front(2))
d.push_front(3)
d.push_front(4)
d.push_back(5)
d.push_back(6)
print(d.show())
#print(d.back())
#print(d.front())