Generates an iterator that traverses a doubly linked list in order (head to tail).
Reuses the singly linked list implementation since forward traversal is identical.
O(n)
O(1)
The type of the doubly linked list node.
The head node of the list, or null if the list is empty.
head
null
An iterator yielding nodes in forward order.
Generates an iterator that traverses a doubly linked list in order (head to tail).
Reuses the singly linked list implementation since forward traversal is identical.
O(n)O(1)- only stores current node reference.