Generates an iterator that traverses a doubly linked list in reverse order (tail to head).
Takes advantage of previous pointers for direct backward traversal, unlike singly linked lists.
O(n)
O(1)
The type of the doubly linked list node.
The tail node of the list, or null if the list is empty.
tail
null
An iterator yielding nodes in reverse order.
Generates an iterator that traverses a doubly linked list in reverse order (tail to head).
Takes advantage of previous pointers for direct backward traversal, unlike singly linked lists.
O(n)O(1)- only stores current node reference.