Method first

linked_lists/linked_deque.py:8–11

(self)

class LinkedDeque(_DoublyLinkedList):

    def first(self):
        if self.is_empty():
            raise Empty("Dequeu is empty") 
        return self._header._next._element
    
    def last(self):
        if self.is_empty():