{"id":146860,"date":"2025-09-17T12:28:24","date_gmt":"2025-09-17T06:58:24","guid":{"rendered":"https:\/\/data-flair.training\/blogs\/?p=146860"},"modified":"2025-09-17T12:28:24","modified_gmt":"2025-09-17T06:58:24","slug":"circular-linked-list-in-dsa-cpp","status":"publish","type":"post","link":"https:\/\/data-flair.training\/blogs\/circular-linked-list-in-dsa-cpp\/","title":{"rendered":"Circular Linked List in DSA C++"},"content":{"rendered":"

Program 1<\/h3>\n
\/\/ Circular Linkedlist\r\n#include<iostream>\r\n#include<stdio.h>\r\nusing namespace std;\r\nclass Node\r\n{\r\n    int data;\r\n    Node *add;\r\n   public:\r\n   void create();\r\n   void insertFirst();\r\n   void insertMiddle();\r\n   void insertLast();\r\n   void deleteFirst();\r\n   void deleteMiddle();\r\n   void deleteLast();\r\n   void display();\r\n};  \r\nNode *start=NULL,*new1,*temp,*prev1,*next1,*last;  \r\nvoid Node::create()\r\n{\r\n     int n;\r\n     char ch;\r\n     cout<<\"Enter an element\";\r\n     cin>>n;\r\n     start=new Node();\r\n     start->data=n;\r\n     start->add=NULL;\r\n     temp=start;\r\n     temp->add=start;\r\n     input1: cout<<\"\\n Want to continue:(Y\/y) \";\r\n     cin>>ch;\r\n    \r\n     while(ch=='y' || ch=='Y')\r\n     {\r\n        cout<<\"Enter an element: \";\r\n        cin>>n;\r\n        new1=new Node();\r\n        new1->data=n;\r\n        new1->add=NULL;\r\n        temp->add=new1;\r\n        new1->add=start;\r\n        temp=temp->add;\r\n        input: cout<<\"\\n Want to continue:(Y\/y) \";\r\n        cin>>ch;\r\n     }\r\n  }   \r\n\r\nvoid Node::insertFirst()\r\n{\r\n     int n;\r\n    if(start==NULL)\r\n    cout<<\"\\n List not found....\";\r\n    else\r\n    {\r\n        cout<<\"\\n Enter an element for insert: \";\r\n        cin>>n;\r\n        new1=new Node();\r\n        new1->data=n;\r\n        new1->add=NULL;\r\n        last=start;\r\n        do\r\n        {\r\n             last=last->add;\r\n        }while(last->add!=start);\r\n        new1->add=start;\r\n        start=new1;\r\n        last->add=start;\r\n    }\r\n\r\n}\r\n\r\nvoid Node::insertMiddle()\r\n{\r\n        int n,pos,i;\r\n    if(start==NULL)\r\n        cout<<\"\\n List not found....\";\r\n    else\r\n    {\r\n        cout<<\"\\n Enter an element for insert: \";\r\n        cin>>n;\r\n        new1=new Node();\r\n        new1->data=n;\r\n        new1->add=NULL;\r\n        cout<<\"\\n Enter poistion: \";\r\n        cin>>pos;\r\n        i=1;\r\n        next1=start;\r\n        while(i<pos)\r\n        {\r\n               prev1=next1;\r\n               next1=next1->add;\r\n               i++;\r\n        }\r\n        prev1->add=new1;\r\n        new1->add=next1;\r\n    }     \r\n}\r\nvoid Node::insertLast()\r\n{\r\n      int n;\r\n    if(start==NULL)\r\n        cout<<\"\\n List not found....\";\r\n    else\r\n    {\r\n        cout<<\"\\n Enter an element for insert: \";\r\n        cin>>n;\r\n        new1=new Node();\r\n        new1->data=n;\r\n        new1->add=NULL;\r\n         last=start;\r\n        do\r\n        {\r\n             last=last->add;\r\n        }while(last->add!=start);\r\n        last->add=new1;\r\n        new1->add=start;\r\n    }  \r\n     \r\n}\r\nvoid Node::deleteFirst()\r\n{\r\n      int n;\r\n    if(start==NULL)\r\n        cout<<\"\\n List not found....\";\r\n    else\r\n    {\r\n         last=start;\r\n        do\r\n        {\r\n             last=last->add;\r\n        }while(last->add!=start);\r\n        temp=start;\r\n        start=start->add;\r\n        last->add=start;\r\n        cout<<\"\\n Deleted node is : \"<<temp->data;\r\n        delete temp;\r\n    }\r\n}\r\nvoid Node::deleteMiddle()\r\n{\r\n      if(start==NULL)\r\n        cout<<\"\\n List not found....\";\r\n    else\r\n    {\r\n        int pos,i=1;\r\n        cout<<\"Enter position for delete: \";\r\n        cin>>pos;\r\n        next1=start;\r\n        while(i<pos)\r\n        {\r\n            prev1=next1;\r\n            next1=next1->add;\r\n            i++;\r\n        }\r\n        temp=next1;\r\n        next1=next1->add;\r\n        prev1->add=next1;\r\n        cout<<\"Deleted node is : \"<<temp->data;\r\n        delete temp;\r\n    }\r\n}\r\nvoid Node::deleteLast()\r\n{\r\n       if(start==NULL)\r\n        cout<<\"\\n List not found....\";\r\n    else\r\n    {\r\n         last=start;\r\n         do\r\n         {\r\n               prev1=last;\r\n               last=last->add;\r\n         }while(last->add!=start);\r\n\r\n         prev1->add=start;\r\n         cout<<\" Deleted node is : \"<<last->data;\r\n         delete last;\r\n    }\r\n}\r\nvoid Node::display()\r\n{\r\n    if(start==NULL)\r\n    cout<<\"\\n List not created....\";\r\n   else\r\n   {\r\n         temp=start;\r\n          do\r\n          {\r\n             cout<<temp->data<<\"   \";\r\n             temp=temp->add;\r\n          }while(temp!=start);\r\n   } \r\n}\r\n\r\nint main()\r\n{\r\n    system(\"cls\");\r\n    Node obj;\r\n    int choice;\r\n   do\r\n  {  \r\n    cout<<\"\\n---------------------Circular Linked List-----------------\";\r\n    cout<<\"\\n 1. Create\";\r\n    cout<<\"\\n 2. Insert First\";\r\n    cout<<\"\\n 3. Insert Middle\";\r\n    cout<<\"\\n 4. Insert Last\";\r\n    cout<<\"\\n 5. Delete First\";\r\n    cout<<\"\\n 6. Delete Middle\";\r\n    cout<<\"\\n 7. Delete Last\";\r\n    cout<<\"\\n 8. Display\";\r\n    cout<<\"\\n 9. Exit\";\r\n    cout<<\"\\n---------------------------------------------------------\";\r\n    cout<<\"\\n Enter your choice: \";\r\n    cin>>choice;\r\n               \r\n    switch(choice)\r\n    {\r\n         case 1:obj.create();break;\r\n         case 2:obj.insertFirst();break;\r\n         case 3:obj.insertMiddle();break;\r\n         case 4:obj.insertLast();break;\r\n         case 5: obj.deleteFirst();break;\r\n         case 6: obj.deleteMiddle();break;\r\n         case 7: obj.deleteLast();break;\r\n         case 8:obj.display();break;\r\n         case 9:break;\r\n         default:cout<<\"\\n Invalid choice\";\r\n    }\r\n}while(choice!=9); \r\n    return 0;\r\n}<\/pre>\n
 <\/p>\n","protected":false},"excerpt":{"rendered":"
Program 1 \/\/ Circular Linkedlist #include<iostream> #include<stdio.h> using namespace std; class Node { int data; Node *add; public: void create(); void insertFirst(); void insertMiddle(); void insertLast(); void deleteFirst(); void deleteMiddle(); void deleteLast(); void display();...<\/p>\n","protected":false},"author":581,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[31449],"tags":[35302,2517,35301,35298,32874,35299,32869,32870,35300],"class_list":["post-146860","post","type-post","status-publish","format-standard","hentry","category-dsa-cpp-tutorials","tag-c-circular-linked-list","tag-circular-linked-list","tag-circular-linked-list-in-c","tag-circular-linked-list-in-dsa-c","tag-dsa-c","tag-dsa-c-circular-linked-list","tag-dsa-c-practical","tag-dsa-c-program","tag-dsa-c-program-on-circular-linked-list"],"yoast_head":"\nCircular Linked List in DSA C++ - DataFlair<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/data-flair.training\/blogs\/circular-linked-list-in-dsa-cpp\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Circular Linked List in DSA C++ - DataFlair\" \/>\n<meta property=\"og:description\" content=\"Program 1 \/\/ Circular Linkedlist #include<iostream> #include<stdio.h> using namespace std; class Node { int data; Node *add; public: void create(); void insertFirst(); void insertMiddle(); void insertLast(); void deleteFirst(); void deleteMiddle(); void deleteLast(); void display();...\" \/>\n<meta property=\"og:url\" content=\"https:\/\/data-flair.training\/blogs\/circular-linked-list-in-dsa-cpp\/\" \/>\n<meta property=\"og:site_name\" content=\"DataFlair\" \/>\n<meta property=\"article:publisher\" content=\"https:\/\/www.facebook.com\/DataFlairWS\/\" \/>\n<meta property=\"article:published_time\" content=\"2025-09-17T06:58:24+00:00\" \/>\n<meta name=\"author\" content=\"DataFlair Team\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:creator\" content=\"@DataFlairWS\" \/>\n<meta name=\"twitter:site\" content=\"@DataFlairWS\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"DataFlair Team\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"1 minute\" \/>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Circular Linked List in DSA C++ - DataFlair","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/data-flair.training\/blogs\/circular-linked-list-in-dsa-cpp\/","og_locale":"en_US","og_type":"article","og_title":"Circular Linked List in DSA C++ - DataFlair","og_description":"Program 1 \/\/ Circular Linkedlist #include<iostream> #include<stdio.h> using namespace std; class Node { int data; Node *add; public: void create(); void insertFirst(); void insertMiddle(); void insertLast(); void deleteFirst(); void deleteMiddle(); void deleteLast(); void display();...","og_url":"https:\/\/data-flair.training\/blogs\/circular-linked-list-in-dsa-cpp\/","og_site_name":"DataFlair","article_publisher":"https:\/\/www.facebook.com\/DataFlairWS\/","article_published_time":"2025-09-17T06:58:24+00:00","author":"DataFlair Team","twitter_card":"summary_large_image","twitter_creator":"@DataFlairWS","twitter_site":"@DataFlairWS","twitter_misc":{"Written by":"DataFlair Team","Est. reading time":"1 minute"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/data-flair.training\/blogs\/circular-linked-list-in-dsa-cpp\/#article","isPartOf":{"@id":"https:\/\/data-flair.training\/blogs\/circular-linked-list-in-dsa-cpp\/"},"author":{"name":"DataFlair Team","@id":"https:\/\/data-flair.training\/blogs\/#\/schema\/person\/c187795dc82ab948373cca526df7c445"},"headline":"Circular Linked List in DSA C++","datePublished":"2025-09-17T06:58:24+00:00","mainEntityOfPage":{"@id":"https:\/\/data-flair.training\/blogs\/circular-linked-list-in-dsa-cpp\/"},"wordCount":8,"commentCount":0,"publisher":{"@id":"https:\/\/data-flair.training\/blogs\/#organization"},"keywords":["c++ circular linked list","Circular Linked List","circular linked list in c++","circular linked list in dsa c++","dsa c++","dsa c++ circular linked list","dsa c++ practical","dsa c++ program","dsa c++ program on circular linked list"],"articleSection":["DSA using C++ Tutorials"],"inLanguage":"en-US","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/data-flair.training\/blogs\/circular-linked-list-in-dsa-cpp\/#respond"]}]},{"@type":"WebPage","@id":"https:\/\/data-flair.training\/blogs\/circular-linked-list-in-dsa-cpp\/","url":"https:\/\/data-flair.training\/blogs\/circular-linked-list-in-dsa-cpp\/","name":"Circular Linked List in DSA C++ - DataFlair","isPartOf":{"@id":"https:\/\/data-flair.training\/blogs\/#website"},"datePublished":"2025-09-17T06:58:24+00:00","breadcrumb":{"@id":"https:\/\/data-flair.training\/blogs\/circular-linked-list-in-dsa-cpp\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/data-flair.training\/blogs\/circular-linked-list-in-dsa-cpp\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/data-flair.training\/blogs\/circular-linked-list-in-dsa-cpp\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Blog Home","item":"https:\/\/data-flair.training\/blogs\/"},{"@type":"ListItem","position":2,"name":"DSA using C++ Tutorials","item":"https:\/\/data-flair.training\/blogs\/category\/dsa-cpp-tutorials\/"},{"@type":"ListItem","position":3,"name":"Circular Linked List in DSA C++"}]},{"@type":"WebSite","@id":"https:\/\/data-flair.training\/blogs\/#website","url":"https:\/\/data-flair.training\/blogs\/","name":"DataFlair","description":"Learn Today. Lead Tomorrow.","publisher":{"@id":"https:\/\/data-flair.training\/blogs\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/data-flair.training\/blogs\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"},{"@type":"Organization","@id":"https:\/\/data-flair.training\/blogs\/#organization","name":"DataFlair","url":"https:\/\/data-flair.training\/blogs\/","logo":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/data-flair.training\/blogs\/#\/schema\/logo\/image\/","url":"https:\/\/data-flair.training\/blogs\/wp-content\/uploads\/sites\/2\/2016\/07\/Data-Flair.png","contentUrl":"https:\/\/data-flair.training\/blogs\/wp-content\/uploads\/sites\/2\/2016\/07\/Data-Flair.png","width":106,"height":48,"caption":"DataFlair"},"image":{"@id":"https:\/\/data-flair.training\/blogs\/#\/schema\/logo\/image\/"},"sameAs":["https:\/\/www.facebook.com\/DataFlairWS\/","https:\/\/x.com\/DataFlairWS","https:\/\/www.linkedin.com\/company\/dataflair-web-services-pvt-ltd\/","https:\/\/www.youtube.com\/user\/DataFlairWS"]},{"@type":"Person","@id":"https:\/\/data-flair.training\/blogs\/#\/schema\/person\/c187795dc82ab948373cca526df7c445","name":"DataFlair Team","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/secure.gravatar.com\/avatar\/2302ebc438084d2f1f993edc1996a0aae01332e81f3227cba8df0c48ec010ca4?s=96&d=mm&r=g","url":"https:\/\/secure.gravatar.com\/avatar\/2302ebc438084d2f1f993edc1996a0aae01332e81f3227cba8df0c48ec010ca4?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/2302ebc438084d2f1f993edc1996a0aae01332e81f3227cba8df0c48ec010ca4?s=96&d=mm&r=g","caption":"DataFlair Team"},"description":"DataFlair Team provides high-impact content on programming, Java, Python, C++, DSA, AI, ML, data Science, Android, Flutter, MERN, Web Development, and technology. We make complex concepts easy to grasp, helping learners of all levels succeed in their tech careers.","url":"https:\/\/data-flair.training\/blogs\/author\/dfteam6\/"}]}},"amp_enabled":true,"_links":{"self":[{"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/posts\/146860","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/users\/581"}],"replies":[{"embeddable":true,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/comments?post=146860"}],"version-history":[{"count":2,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/posts\/146860\/revisions"}],"predecessor-version":[{"id":146870,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/posts\/146860\/revisions\/146870"}],"wp:attachment":[{"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/media?parent=146860"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/categories?post=146860"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/tags?post=146860"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}