Method last

linked_lists/linked_deque.py:13–16

(self)

        return self._header._next._element
    
    def last(self):
        if self.is_empty():
            raise Empty("Dequeu is empty")
        return self._trailer._previous._element
    
    def insert_first(self, element):
        self._insert_between(element, self._header, self._trailer)