{"id":26859,"date":"2017-12-26T20:23:31","date_gmt":"2017-12-26T14:53:31","guid":{"rendered":"https:\/\/www.wikitechy.com\/technology\/?p=26859"},"modified":"2017-12-26T20:23:31","modified_gmt":"2017-12-26T14:53:31","slug":"circular-linked-list-traversal","status":"publish","type":"post","link":"https:\/\/www.wikitechy.com\/technology\/circular-linked-list-traversal\/","title":{"rendered":"Circular Linked List | Set 2 (Traversal)"},"content":{"rendered":"

We have discussed Circular Linked List Introduction and Applications,<\/a> in the previous post on Circular Linked List. In this post, traversal operation is discussed.<\/p>\n

\"Circular<\/p>\n

In a conventional linked list, we traverse the list from the head node and stop the traversal when we reach NULL. In a circular linked list, we stop traversal when we reach the first node again. Following is C code for linked list traversal.<\/p>\n

<\/div> 
\/* Function to traverse a given Circular linked list and print nodes *\/void printList(struct node *first){    struct node *temp = first;      \/\/ If linked list is not empty    if (first != NULL)     {        \/\/ Keep printing nodes till we reach the first node again        do        {            printf("%d ", temp->data);            temp = temp->next;        }        while (temp != first);    }}<\/code><\/pre> <\/div>\n[ad type=”banner”]\n
Complete C program to demonstrate traversal.<\/strong> Following is complete C program to demonstrate traversal of circular linked list.<\/p>\n
 
 <\/div> 
#include<stdio.h>#include<stdlib.h> \/* structure for a node *\/struct node{    int data;    struct node *next;}; \/* Function to insert a node at the begining of a Circular   linked list *\/void push(struct node **head_ref, int data){    struct node *ptr1 = (struct node *)malloc(sizeof(struct node));    struct node *temp = *head_ref;    ptr1->data = data;    ptr1->next = *head_ref;     \/* If linked list is not NULL then set the next of last node *\/    if (*head_ref != NULL)    {        while (temp->next != *head_ref)            temp = temp->next;        temp->next = ptr1;    }    else        ptr1->next = ptr1; \/*For the first node *\/     *head_ref = ptr1;} \/* Function to print nodes in a given Circular linked list *\/void printList(struct node *head){    struct node *temp = head;    if (head != NULL)    {        do        {            printf("%d ", temp->data);            temp = temp->next;        }        while (temp != head);    }} \/* Driver program to test above functions *\/int main(){    \/* Initialize lists as empty *\/    struct node *head = NULL;     \/* Created linked list will be 11->2->56->12 *\/    push(&head, 12);    push(&head, 56);    push(&head, 2);    push(&head, 11);     printf("Contents of Circular Linked List\\n ");    printList(head);     return 0;}<\/code><\/pre> <\/div>\n
Output:<\/p>\n
Contents of Circular Linked List\r\n 11 2 56 12<\/pre>\n[ad type=”banner”]\n","protected":false},"excerpt":{"rendered":"
Circular Linked List (Traversal) – Circular Linked List In a conventional linked list, we traverse the list from the head node and stop the traversal.<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[79477,79476],"tags":[80116,83741,80119,80096,80118,83738,83740,83739,80117,80115,79561,83734,83736,83735,83737],"class_list":["post-26859","post","type-post","status-publish","format-standard","hentry","category-circular-linked-list","category-linked-list","tag-algorithm-for-circular-linked-list-in-data-structure","tag-algorithm-for-traversing-a-circular-linked-list","tag-circular-doubly-linked-list-java-code","tag-circular-linked-list-algorithm-pdf","tag-circular-linked-list-applications-circular-linked-list-algorithm-ppt","tag-circular-linked-list-in-c-algorithm","tag-circular-linked-list-in-c-pdf","tag-circular-linked-list-in-c-program","tag-circular-linked-list-in-c","tag-circular-linked-list-insertion-and-deletion-program","tag-circular-linked-list-java","tag-circular-linked-list-traversal-algorithm","tag-search-an-item-from-circular-header-linked-list","tag-traversing-a-circular-linked-list-java","tag-write-an-algorithm-to-search-an-item-from-circular-header-linked-list"],"_links":{"self":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/26859","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/comments?post=26859"}],"version-history":[{"count":0,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/26859\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media?parent=26859"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/categories?post=26859"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/tags?post=26859"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}