Traversal of linked list always starts from First Node - Data Structure

Discussion

• Nirja Shah   -Posted on 18 Nov 15
  Traversal of a linked list always starts from the First Node.
  Example:
  struct node
  {
      Int data;
      struct node ∗ link;
  } ∗ start;
  For traversing a single link list we will take a pointer P of type struct node and initialized with start.
  P=start;
  Now P points to the first node of link list. Link list can be traversed as follows.
  while(P ! NULL)
  {
      cout << (P→ data);
      P = P→link;
  }

➨ Post your comment / Share knowledge