• Generates an iterator that traverses a singly linked list in reverse order.

    • Time Complexity (complete traversal): O(n)
    • Space Complexity: O(n) - requires stack storage for all nodes.

    Type Parameters

    Parameters

    • head: null | N

      The head node of the list, or null if the list is empty.

    Returns Generator<N, void, unknown>

    An iterator yielding nodes in reverse order.