Generates an iterator that traverses a singly linked list in reverse order.
O(n)
The type of the singly linked list node.
The head node of the list, or null if the list is empty.
head
null
An iterator yielding nodes in reverse order.
Generates an iterator that traverses a singly linked list in reverse order.
O(n)
O(n)
- requires stack storage for all nodes.