From 878130bccdc35d6549fa73dea2f2a1deb891f4b2 Mon Sep 17 00:00:00 2001
From: Assassin-compiler <70448612+Assassin-compiler@users.noreply.github.com>
Date: Sat, 30 Oct 2021 16:29:15 +0530
Subject: [PATCH] Create CircularLinkedlist.cpp

---
 CircularLinkedlist.cpp | 68 ++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 68 insertions(+)
 create mode 100644 CircularLinkedlist.cpp

diff --git a/CircularLinkedlist.cpp b/CircularLinkedlist.cpp
new file mode 100644
index 0000000..435efaf
--- /dev/null
+++ b/CircularLinkedlist.cpp
@@ -0,0 +1,68 @@
+#include <bits/stdc++.h>
+using namespace std;
+ 
+/* structure for a node */
+class Node
+{
+    public:
+    int data;
+    Node *next;
+};
+ 
+/* Function to insert a node at the beginning
+of a Circular linked list */
+void push(Node **head_ref, int data)
+{
+    Node *ptr1 = new Node();
+    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(Node *head)
+{
+    Node *temp = head;
+    if (head != NULL)
+    {
+        do
+        {
+            cout << temp->data << " ";
+            temp = temp->next;
+        }
+        while (temp != head);
+    }
+}
+ 
+/* Driver program to test above functions */
+int main()
+{
+    /* Initialize lists as empty */
+    Node *head = NULL;
+ 
+    /* Created linked list will be 11->2->56->12 */
+    push(&head, 12);
+    push(&head, 56);
+    push(&head, 2);
+    push(&head, 11);
+ 
+    cout << "Contents of Circular Linked List\n ";
+    printList(head);
+ 
+    return 0;
+}
+