(self)
od.__reversed__() <==> reversed(od)
od.__reversed__() <==> reversed(od)
od . __reversed__ () < == > reversed ( od )
def __reversed__(self):
        'od.__reversed__() <==> reversed(od)'
        # Traverse the linked list in reverse order.
        root = self.__root
        curr = root.prev
        while curr is not root:
            yield curr.key
            curr = curr.prev
def __reversed__ ( self ) : # Traverse the linked list in reverse order. root = self . __root curr = root . prev while curr is not root : yield curr . key curr = curr . prev