Singly-linked list/Traversal

From Rosetta Code
Task
Singly-linked list/Traversal
You are encouraged to solve this task according to the task description, using any language you may know.

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

Java

For Java.util.LinkedList<T>, use a for each loop (from Loop Structures): 

LinkedList<Type> list = new LinkedList<Type>();

for(Type i: list){
  //each element will be in variable "i"
  System.out.println(i);
}
Retrieved from "https://rosettacode.org/wiki/Singly-linked_list/Traversal?oldid=40018"