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


Procedure traverse(*node.MyData)
  While *node
    ;access data, i.e. PrintN(Str(*node\Value)) 
    *node = *node\next
  Wend
EndProcedure
 
;called using
traverse(*firstnode.MyData)