Traversing in Singly Linked List

by Online Tutorials Library July 22, 2022

Traversing in singly linked list

Traversing is the most common operation that is performed in almost every scenario of singly linked list. Traversing means visiting each node of the list once in order to perform some operation on that. This will be done by using the following statements.

Algorithm

STEP 1: SET PTR = HEAD
STEP 2: IF PTR = NULL

WRITE “EMPTY LIST”
GOTO STEP 7
END OF IF

STEP 4: REPEAT STEP 5 AND 6 UNTIL PTR != NULL
STEP 5: PRINT PTR→ DATA
STEP 6: PTR = PTR → NEXT

[END OF LOOP]

STEP 7: EXIT

C function

  #include<stdio.h>  #include<stdlib.h>  void create(int);  void traverse();  struct node  {  int data;  struct node *next;  };  struct node *head;  void main ()  {  int choice,item;  do   {  printf(“n1.Append Listn2.Traversen3.Exitn4.Enter your choice?”);  scanf(“%d”,&choice);  switch(choice)  {  case 1:  printf(“nEnter the itemn”);  scanf(“%d”,&item);  create(item);  break;   case 2:  traverse();  break;   case 3:  exit(0);  break;  default:  printf(“nPlease enter valid choicen”);  }    }while(choice != 3);  }  void create(int item)  {  struct node *ptr = (struct node *)malloc(sizeof(struct node *));  if(ptr == NULL)  {  printf(“nOVERFLOWn”);  }  else  {  ptr->data = item;  ptr->next = head;  head = ptr;  printf(“nNode insertedn”);  }    }  void traverse()  {  struct node *ptr;   ptr = head;   if(ptr == NULL)  {  printf(“Empty list..”);  }  else  {  printf(“printing values . . . . .n”);   while (ptr!=NULL)  {  printf(“n%d”,ptr->data);  ptr = ptr -> next;  }  }   }  

Output

1.Append List  2.Traverse  3.Exit  4.Enter your choice?1    Enter the item  23    Node inserted    1.Append List  2.Traverse  3.Exit  4.Enter your choice?1    Enter the item  233    Node inserted    1.Append List  2.Traverse  3.Exit  4.Enter your choice?2  printing values . . . . .    233  23

Next Topic#

Traversing in Singly Linked List

Traversing in singly linked list

Algorithm

C function

DAA Algorithm

Chutney vs Pickle

You may also like