Data Structure - Traversing a linked list algorithm

Traversing a linked list

Algorithm

  1. Set ptr:=start
  2. Repeat while ptr!=null.(ptr is not equal to null.)
  3. Apply PROCESS to INFO[ptr]
  4. Set ptr:=Link[ptr]
    [end of loop]
  5. Exit.

Comments

Popular posts from this blog

Theory part introduction

Data structure - Sorting methodes