Circular Linked List Traversal.cpp

Author: Ride010

Linked List Basics/Circular Linked List Traversal.cpp

@@ -0,0 +1,78 @@
+#include<stdio.h>
+#include<stdlib.h>
+
+struct Node
+{
+    int data;
+    struct Node *next;
+};
+
+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 (*head_ref != NULL)
+    {
+        while (temp->next != *head_ref)
+            temp = temp->next;
+        temp->next = ptr1;
+    }
+    else
+        ptr1->next = ptr1; 
+
+    *head_ref = ptr1;
+}
+
+void printList(struct Node*);
+
+int main()
+{
+    int i,n,t,val;
+    scanf("%d",&t);
+
+    while(t--)
+        {
+         struct Node *head = NULL;
+         scanf("%d",&n);
+         for(i=0;i<n;i++)
+          {
+            scanf("%d",&val);
+            push(&head,val);
+          }
+         printList(head);
+         printf("\n");
+        }
+    return 0;
+}
+// } Driver Code Ends
+
+
+/* structure for a node 
+struct Node
+{
+    int data;
+    struct Node *next;
+}; */
+
+/* Function to print nodes in a given Circular linked list */
+void printList(struct Node *head)
+{
+  // code here
+  if(head==NULL)
+    return;
+   printf("%d ",head->data);
+   
+  struct Node *cur=head->next;
+
+  
+  while(cur!=head)
+  {
+      printf("%d ",cur->data);
+      cur=cur->next;
+
+  }
+  
+}