{"id":135426,"date":"2024-05-25T16:38:05","date_gmt":"2024-05-25T11:08:05","guid":{"rendered":"https:\/\/data-flair.training\/blogs\/?p=135426"},"modified":"2024-05-25T16:38:05","modified_gmt":"2024-05-25T11:08:05","slug":"circular-doubly-linked-list-in-dsa-using-cpp-part-2","status":"publish","type":"post","link":"https:\/\/data-flair.training\/blogs\/circular-doubly-linked-list-in-dsa-using-cpp-part-2\/","title":{"rendered":"Circular Doubly Linked List in DSA using C++ Part – 2"},"content":{"rendered":"

Program 1<\/h3>\n
\/\/ Circular double linked list code\r\n#include<iostream>\r\n#include<stdio.h>\r\n#define clrscr() system(\"cls\")\r\nusing namespace std;\r\nclass node\r\n{\r\n    public:\r\n     node *ladd;\r\n     int data;\r\n     node *radd;\r\n};\r\nint count=0;\r\nnode *start=NULL,*new1,*temp,*prv,*nxt;\r\nvoid create();\r\nvoid display();\r\nvoid insertfirst();\r\nvoid insertmid();\r\nvoid insertlast();\r\nvoid delfirst();\r\nvoid delmid();\r\nvoid dellast();\r\nint main()\r\n{\r\n     int choice;\r\n     clrscr();\r\n    do\r\n   { \r\n    cout<<\"\\n--------------------Circular Double Linked List------------------\";\r\n    cout<<\"\\n1.Create\";\r\n    cout<<\"\\n2.Display\";\r\n    cout<<\"\\n3.Insert First\";\r\n    cout<<\"\\n4.Insert Middle\";\r\n    cout<<\"\\n5.Insert Last\";\r\n    cout<<\"\\n6.Delete First\";\r\n    cout<<\"\\n7.Delete Middle\";\r\n    cout<<\"\\n8.Delete Last\";\r\n    cout<<\"\\n9.Exit\";\r\n    cout<<\"\\n-------------------------------------------------------------------\";\r\n    cout<<\"\\n Enter your choice\";\r\n    cin>>choice;\r\n  switch(choice)   \r\n  {\r\n     case 1:create();break;\r\n     case 2:display();break;\r\n     case 3:insertfirst();break;\r\n     case 4:insertmid();break;\r\n     case 5:insertlast();break;\r\n     case 6:delfirst();break;\r\n     case 7:delmid();break;\r\n     case 8:dellast();break;\r\n     case 9:break;\r\n     default:cout<<\"Invalid choice\";\r\n  }\r\n   }while(choice!=9);\r\n}\r\nvoid 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     temp=start;\r\n     start->data=n;\r\n     start->ladd=temp;\r\n     start->radd=temp;\r\n     count++;\r\n     cout<<\"want to continue\";\r\n     cin>>ch;\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->ladd=temp;\r\n        temp->radd=new1;\r\n        start->ladd=new1;\r\n        new1->radd=start;\r\n        temp=temp->radd;\r\n        count++;\r\n        cout<<\"want to continue\";\r\n        cin>>ch;\r\n\r\n     }\r\n}\r\nvoid display()\r\n{\r\n\/\/     temp=start;\r\n\/\/     cout<<\"\\nFirst Node: \"<<temp->data;\r\n\/\/     temp=temp->ladd;\r\n\/\/   cout<<\"\\nLast Node: \"<<temp->data;\r\n\/\/    temp=temp->radd;\r\n\/\/  cout<<\"\\nFirst Node: \"<<temp->data;\r\n\r\n    if(start==NULL)\r\n    cout<<\"\\nList not found\";\r\n    else\r\n  {  \r\n    temp=start;\r\n    do\r\n    {\r\n        cout<<temp->data<<\"  \";\r\n        temp=temp->radd;\r\n\r\n    } while (temp!=start);\r\n    cout<<\"\\n Total Node is List: \"<<count;\r\n  }   \r\n}\r\nvoid 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          temp=start->ladd;\r\n          new1=new node;\r\n          new1->data=n;\r\n          new1->radd=start;\r\n          start->ladd=new1;\r\n          start=new1;\r\n          start->ladd=temp;\r\n          temp->radd=start;\r\n          count++;\r\n\r\n     }\r\n}\r\nvoid insertmid()\r\n{\r\n\r\n      int n,pos,i=1;\r\n      if(start==NULL)\r\n         cout<<\"\\n List not found\";\r\n     else\r\n    {     \r\n      cout<<\"\\nEnter position for insert\";\r\n      cin>>pos;\r\n      if(pos>count)\r\n        cout<<\"\\n Invalid position\";\r\n     else\r\n     {\r\n             cout<<\"\\nEnter an element for insert\";\r\n             cin>>n;\r\n             new1=new node;\r\n             new1->data=n;\r\n             nxt=start;\r\n             while(i<pos)\r\n             {\r\n                 prv=nxt;\r\n                 nxt=nxt->radd;\r\n                 i++;\r\n             }\r\n             prv->radd=new1;\r\n             new1->ladd=prv;\r\n             new1->radd=nxt;\r\n             nxt->ladd=prv;\r\n             count++;\r\n     }\r\n   }\r\n}\r\nvoid 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          temp=start->ladd;\r\n          temp->radd=new1;\r\n          new1->ladd=temp;\r\n          start->ladd=new1;\r\n          new1->radd=start;\r\n          count++;\r\n     }    \r\n\r\n\r\n}\r\nvoid delfirst()\r\n{\r\n     if(start==NULL)\r\n     cout<<\"\\n List not found....\";\r\n    else\r\n    {\r\n        nxt=start->ladd;\r\n        temp=start;\r\n        start=start->radd;\r\n        nxt->radd=start;\r\n        start->ladd=nxt;\r\n        cout<<\"Delete node: \"<<temp->data;\r\n        delete temp;\r\n        count--;\r\n    }\r\n\r\n}\r\nvoid delmid()\r\n{\r\n     int pos,i;\r\n    if(start==NULL)\r\n      cout<<\"\\n List not found.....\";\r\n    else\r\n    {\r\n        cout<<\"\\nEnter position for delete\";\r\n        cin>>pos;\r\n        if(pos>count)\r\n            cout<<\"\\n Invalid position\";\r\n        else\r\n        {\r\n             i=1;\r\n             temp=start;\r\n             while(i<pos)\r\n             {\r\n                 temp=temp->radd;\r\n                 i++;\r\n             }\r\n             prv=temp->ladd;\r\n             nxt=temp->radd;\r\n             prv->radd=nxt;\r\n             nxt->ladd=prv;\r\n             cout<<\"\\n Deleted node: \"<<temp->data;\r\n             delete temp;\r\n             count--;\r\n        }    \r\n        \r\n    }  \r\n}\r\nvoid dellast()\r\n{\r\n   if(start==NULL)\r\n       cout<<\"\\n List not found...\";\r\n    else\r\n    {\r\n        temp=start->ladd;\r\n        prv=temp->ladd;\r\n        start->ladd=prv;\r\n        prv->radd=start;\r\n        cout<<\"\\n Deleted node : \"<<temp->data;\r\n        delete temp;\r\n        count--;\r\n\r\n    }   \r\n}<\/pre>\n
 <\/p>\n","protected":false},"excerpt":{"rendered":"
Program 1 \/\/ Circular double linked list code #include<iostream> #include<stdio.h> #define clrscr() system(“cls”) using namespace std; class node { public: node *ladd; int data; node *radd; }; int count=0; node *start=NULL,*new1,*temp,*prv,*nxt; void create(); void...<\/p>\n","protected":false},"author":86671,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[31449],"tags":[32278,32277,24331,32265,32249,32251,32250,32279],"class_list":["post-135426","post","type-post","status-publish","format-standard","hentry","category-dsa-cpp-tutorials","tag-circular-doubly-linked-list","tag-circular-doubly-linked-list-in-dsa-using-c","tag-data-structures","tag-data-structures-using-c","tag-dsa-using-c","tag-dsa-using-c-practical","tag-dsa-using-c-program","tag-dsa-with-c"],"yoast_head":"\nCircular Doubly Linked List in DSA using C++ Part - 2 - 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-doubly-linked-list-in-dsa-using-cpp-part-2\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Circular Doubly Linked List in DSA using C++ Part - 2 - DataFlair\" \/>\n<meta property=\"og:description\" content=\"Program 1 \/\/ Circular double linked list code #include<iostream> #include<stdio.h> #define clrscr() system("cls") using namespace std; class node { public: node *ladd; int data; node *radd; }; int count=0; node *start=NULL,*new1,*temp,*prv,*nxt; void create(); void...\" \/>\n<meta property=\"og:url\" content=\"https:\/\/data-flair.training\/blogs\/circular-doubly-linked-list-in-dsa-using-cpp-part-2\/\" \/>\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=\"2024-05-25T11:08:05+00:00\" \/>\n<meta name=\"author\" content=\"TechVidvan 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=\"TechVidvan 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 Doubly Linked List in DSA using C++ Part - 2 - 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-doubly-linked-list-in-dsa-using-cpp-part-2\/","og_locale":"en_US","og_type":"article","og_title":"Circular Doubly Linked List in DSA using C++ Part - 2 - DataFlair","og_description":"Program 1 \/\/ Circular double linked list code #include<iostream> #include<stdio.h> #define clrscr() system(\"cls\") using namespace std; class node { public: node *ladd; int data; node *radd; }; int count=0; node *start=NULL,*new1,*temp,*prv,*nxt; void create(); void...","og_url":"https:\/\/data-flair.training\/blogs\/circular-doubly-linked-list-in-dsa-using-cpp-part-2\/","og_site_name":"DataFlair","article_publisher":"https:\/\/www.facebook.com\/DataFlairWS\/","article_published_time":"2024-05-25T11:08:05+00:00","author":"TechVidvan Team","twitter_card":"summary_large_image","twitter_creator":"@DataFlairWS","twitter_site":"@DataFlairWS","twitter_misc":{"Written by":"TechVidvan Team","Est. reading time":"1 minute"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/data-flair.training\/blogs\/circular-doubly-linked-list-in-dsa-using-cpp-part-2\/#article","isPartOf":{"@id":"https:\/\/data-flair.training\/blogs\/circular-doubly-linked-list-in-dsa-using-cpp-part-2\/"},"author":{"name":"TechVidvan Team","@id":"https:\/\/data-flair.training\/blogs\/#\/schema\/person\/0e594f928e31fc96628ac40f6ae74f49"},"headline":"Circular Doubly Linked List in DSA using C++ Part – 2","datePublished":"2024-05-25T11:08:05+00:00","mainEntityOfPage":{"@id":"https:\/\/data-flair.training\/blogs\/circular-doubly-linked-list-in-dsa-using-cpp-part-2\/"},"wordCount":12,"commentCount":0,"publisher":{"@id":"https:\/\/data-flair.training\/blogs\/#organization"},"keywords":["circular doubly linked list","circular doubly linked list in dsa using c++","Data Structures","data structures using c++","dsa using c++","dsa using c++ practical","dsa using c++ program","dsa with c++"],"articleSection":["DSA using C++ Tutorials"],"inLanguage":"en-US","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/data-flair.training\/blogs\/circular-doubly-linked-list-in-dsa-using-cpp-part-2\/#respond"]}]},{"@type":"WebPage","@id":"https:\/\/data-flair.training\/blogs\/circular-doubly-linked-list-in-dsa-using-cpp-part-2\/","url":"https:\/\/data-flair.training\/blogs\/circular-doubly-linked-list-in-dsa-using-cpp-part-2\/","name":"Circular Doubly Linked List in DSA using C++ Part - 2 - DataFlair","isPartOf":{"@id":"https:\/\/data-flair.training\/blogs\/#website"},"datePublished":"2024-05-25T11:08:05+00:00","breadcrumb":{"@id":"https:\/\/data-flair.training\/blogs\/circular-doubly-linked-list-in-dsa-using-cpp-part-2\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/data-flair.training\/blogs\/circular-doubly-linked-list-in-dsa-using-cpp-part-2\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/data-flair.training\/blogs\/circular-doubly-linked-list-in-dsa-using-cpp-part-2\/#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 Doubly Linked List in DSA using C++ Part – 2"}]},{"@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\/0e594f928e31fc96628ac40f6ae74f49","name":"TechVidvan Team","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/secure.gravatar.com\/avatar\/c89190da3d4010c71ba476b618ab10fdc2335c82cdfa0ad5002d98d0f2473444?s=96&d=mm&r=g","url":"https:\/\/secure.gravatar.com\/avatar\/c89190da3d4010c71ba476b618ab10fdc2335c82cdfa0ad5002d98d0f2473444?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/c89190da3d4010c71ba476b618ab10fdc2335c82cdfa0ad5002d98d0f2473444?s=96&d=mm&r=g","caption":"TechVidvan Team"},"description":"TechVidvan Team provides high-quality content & courses on AI, ML, Data Science, Data Engineering, Data Analytics, programming, Python, DSA, Android, Flutter, full stack web dev, MERN, and many latest technology.","url":"https:\/\/data-flair.training\/blogs\/author\/test001\/"}]}},"amp_enabled":true,"_links":{"self":[{"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/posts\/135426","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\/86671"}],"replies":[{"embeddable":true,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/comments?post=135426"}],"version-history":[{"count":4,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/posts\/135426\/revisions"}],"predecessor-version":[{"id":142568,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/posts\/135426\/revisions\/142568"}],"wp:attachment":[{"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/media?parent=135426"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/categories?post=135426"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/tags?post=135426"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}