Traverse from the beginning of a singly-linked list to the end.



See also

 Array
 Associative array: Creation, Iteration
 Collections
 Compound data type
 Doubly-linked list: Definition, Element definition, Element insertion, List Traversal, Element Removal
 Linked list
 Queue: Definition, Usage
 Set
 Singly-linked list: Element definition, Element insertion, List Traversal, Element Removal
 Stack


struct SLinkedNode(T) {
    T data;
    typeof(this)* next;
}
 
void main() {
    import std.stdio;
 
    alias N = SLinkedNode!int;
    auto lh = new N(1, new N(2, new N(3, new N(4))));
 
    for (auto p = lh; p; p = p.next)
        write(p.data, " ");
    writeln();
}