Traversing a linked List

Algorithm: (Traversing a linked List) Let LIST be a linked list in memory. This algorithm traverse LIST, applying an operation PROCESS to each element of LIST.

The variable PTR points to the node currently being processed.

1.  Set PTR : = START .    [Initialize pointer PTR]

2.  Repeat Steps 3 and 4 while PTR != NULL.

3.  Apply PROCESS to INFO[PTR]

4.  Set PTR : = LINK[PTR].  [PTR now points to the next node.]

   [End of Step 2 Loop]

5. Exit.

If You want to learn about the technology, computer science & engineering, web programming, freelancing, earning please click here :CSE SOLVE