Traversing in Circular Singly Linked List

by Online Tutorials Library July 22, 2022

Traversing in Circular Singly linked list

Traversing in circular singly linked list can be done through a loop. Initialize the temporary pointer variable temp to head pointer and run the while loop until the next pointer of temp becomes head. The algorithm and the c function implementing the algorithm is described as follows.

Algorithm

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

WRITE “EMPTY LIST”
GOTO STEP 8
END OF IF

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

[END OF LOOP]

STEP 7: PRINT PTR→ DATA
STEP 8: 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(“1.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));        struct node *temp;  if(ptr == NULL)        {            printf(“nOVERFLOW”);        }        else         {            ptr -> data = item;            if(head == NULL)            {                head = ptr;                ptr -> next = head;            }            else             {                   temp = head;                while(temp->next != head)                    temp = temp->next;                ptr->next = head;                 temp -> next = ptr;                 head = ptr;            }     printf(“nNode Insertedn”);      }                    }    void traverse()  {  struct node *ptr;  ptr=head;  if(head == NULL)  {  printf(“nnothing to print”);  }  else  {  printf(“n printing values … n”);    while(ptr -> next != head)  {    printf(“%dn”, ptr -> data);  ptr = ptr -> next;  }  printf(“%dn”, ptr -> data);  }    }  

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?2     printing values ...   23

Next TopicDoubly Linked List

Traversing in Circular Singly Linked List

Traversing in Circular Singly linked list

Algorithm

C Function

DAA Algorithm

Chutney vs Pickle

You may also like