{"id":146877,"date":"2025-09-19T15:56:58","date_gmt":"2025-09-19T10:26:58","guid":{"rendered":"https:\/\/data-flair.training\/blogs\/?p=146877"},"modified":"2025-09-19T15:56:58","modified_gmt":"2025-09-19T10:26:58","slug":"circular-doubly-linked-list-in-dsa-cpp","status":"publish","type":"post","link":"https:\/\/data-flair.training\/blogs\/circular-doubly-linked-list-in-dsa-cpp\/","title":{"rendered":"Circular Doubly Linked List in DSA C++"},"content":{"rendered":"

Program 1<\/h3>\n
\/\/ Circular Double Linked List\r\n#include<iostream>\r\n#include<stdio.h>\r\nusing namespace std;\r\n\r\nclass Node\r\n{\r\n    Node *ladd;\r\n    int data;\r\n    Node *radd;\r\n    public:\r\n    void create();\r\n    void display();\r\n    void reverseDisplay();\r\n    void insert_first();\r\n    void insert_middle();\r\n    void insert_last();\r\n    void delete_first();\r\n    void delete_middle();\r\n    void delete_last();\r\n    void search_data();\r\n    void count_node();\r\n}; Node *start=NULL,*new1,*prev1,*next1,*temp,*last;\r\n\r\n\r\nvoid Node:: create()\r\n{\r\n        int n;\r\n        char choice;\r\n        cout<<\"\\n Enter an element: \";\r\n        cin>>n;\r\n        start=new Node();\r\n        start->ladd=NULL;\r\n         start->data=n;\r\n        start->radd=NULL;\r\n       \r\n        temp=start;\r\n        start->ladd=temp;\r\n        temp->radd=start;\r\n        cout<<\"\\n Want to continue(y\/Y): \";\r\n        cin>>choice;\r\n        while(choice=='y' || choice=='Y')\r\n        {\r\n             cout<<\"\\n Enter next element: \";\r\n            cin>>n;\r\n            new1=new Node();\r\n            new1->ladd=NULL;\r\n            new1->data=n;\r\n            new1->radd=NULL;\r\n            temp->radd=new1;\r\n            new1->ladd=temp;\r\n            temp=temp->radd;\r\n            start->ladd=new1;\r\n            new1->radd=start;\r\n            cout<<\"\\n Want to continue(y\/Y): \";\r\n            cin>>choice;\r\n        }\r\n}\r\n void Node:: display()\r\n {\r\n     if(start==NULL)\r\n       cout<<\"\\n List is empty..\";\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          } while (temp!=start);\r\n              \r\n    }\r\n }\r\n\r\n void Node:: insert_first()\r\n {\r\n      int n;\r\n    if(start==NULL)\r\n       cout<<\"\\n List is empty..\";\r\n     else\r\n     {\r\n           cout<<\"Enter an element for insert: \";\r\n           cin>>n;\r\n           new1=new Node();\r\n           new1->ladd=NULL;\r\n           new1->data=n;\r\n           new1->radd=NULL;\r\n           last=start->ladd;\r\n           new1->radd=start;\r\n           start->ladd=new1;\r\n           start=new1;\r\n           start->ladd=last;\r\n           last->radd=start;\r\n\r\n     }\r\n }\r\n void Node:: insert_last()\r\n {\r\n      int n;\r\n    if(start==NULL)\r\n       cout<<\"\\n List is empty..\";\r\n     else\r\n     {\r\n          cout<<\"Enter an element for insert: \";\r\n           cin>>n;\r\n           new1=new Node();\r\n           new1->ladd=NULL;\r\n           new1->data=n;\r\n           new1->radd=NULL;\r\n           last=start->ladd;\r\n           last->radd=new1;\r\n           new1->ladd=last;\r\n           start->ladd=new1;\r\n     }\r\n }   \r\n\r\n void Node::insert_middle()\r\n{\r\n\r\n    if(start==NULL)\r\n       cout<<\"\\n List is empty\";\r\n      else\r\n      {\r\n          int n,pos,i=1;\r\n          cout<<\"\\n Enter an element: \";\r\n          cin>>n;\r\n          new1=new Node();\r\n          new1->data=n;\r\n          new1->ladd=NULL;\r\n          new1->radd=NULL;\r\n          cout<<\"\\n Enter poistion of Middle: \";\r\n          cin>>pos;\r\n          next1=start;\r\n          while(i<pos)\r\n          {\r\n             prev1=next1;\r\n             next1=next1->radd;\r\n             i++;\r\n          }\r\n          prev1->radd=new1;\r\n          new1->ladd=prev1;\r\n          new1->radd=next1;\r\n          next1->ladd=prev1;\r\n      }   \r\n}\r\nvoid Node::delete_first()\r\n{\r\n    if(start==NULL)\r\n       cout<<\"\\n List is empty\";\r\n      else\r\n      {\r\n          temp=start;\r\n          last=start->ladd;\r\n          start=start->radd;\r\n          start->ladd=last;\r\n          last->radd=start;\r\n          cout<<\"\\n Deleted node is : \"<<temp->data;\r\n          delete temp;\r\n      } \r\n}\r\n\r\nvoid Node::delete_last()\r\n{\r\n      if(start==NULL)\r\n       cout<<\"\\n List is empty\";\r\n      else\r\n      {\r\n              temp=start->ladd;\r\n              last=temp->ladd;\r\n              start->ladd=last;\r\n              last->radd=start;\r\n              cout<<\"\\n Deleted node is : \"<<temp->data;\r\n             delete temp;\r\n      }\r\n}\r\nvoid Node::delete_middle()\r\n{\r\n    if(start==NULL)\r\n       cout<<\"\\n List is empty\";\r\n      else\r\n      {\r\n              int pos,i=1;\r\n              cout<<\"\\n Enter the node poistion 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->radd;\r\n                  i++;\r\n              }\r\n              temp=next1;\r\n              next1=next1->radd;\r\n              prev1->radd=next1;\r\n              next1->ladd=prev1;\r\n              cout<<\"\\n Deleted node is : \"<<temp->data;\r\n              delete temp;\r\n      }\r\n}\r\nvoid Node::search_data()\r\n{\r\n    if(start==NULL)\r\n       cout<<\"\\n List is empty\";\r\n      else\r\n      {  \r\n           int s,flag=0;\r\n            cout<<\"\\n Enter an element for search: \";\r\n            cin>>s;\r\n            temp=start;\r\n            do\r\n            {\r\n                if(s==temp->data)\r\n                {\r\n                      flag=1;\r\n                      break;\r\n                } \r\n                temp=temp->radd;\r\n\r\n            }while(temp!=start);\r\n           if(flag==1) \r\n            cout<<\"\\n **** Searching success *****\";\r\n           else\r\n            cout<<\"\\n **** Searching not success *****\";\r\n           \r\n      }\r\n}\r\nvoid Node::count_node()\r\n{\r\n    if(start==NULL)\r\n       cout<<\"\\n List is empty\";\r\n      else\r\n      {  \r\n           int count=0;\r\n           temp=start;\r\n           do\r\n           {\r\n               count++;\r\n               temp=temp->radd;\r\n           } while (temp!=start);\r\n           cout<<\"\\n Total node is :\"<<count;\r\n      }\r\n}\r\nint main()\r\n{\r\n    system(\"cls\");\r\n    int choice;\r\n    Node obj;\r\n  do\r\n  {  \r\n    cout<<\"\\n------------Circluar Double Linked List Menu-----------------------\";\r\n    cout<<\"\\n 1. Create\";\r\n    cout<<\"\\n 2. Display\";\r\n    cout<<\"\\n 3. Insert First\";\r\n    cout<<\"\\n 4. Insert Middle\";\r\n    cout<<\"\\n 5. Insert Last\";\r\n    cout<<\"\\n 6. Delete First\";\r\n    cout<<\"\\n 7. Delete Middle\";\r\n    cout<<\"\\n 8. Delete Last\";\r\n    cout<<\"\\n 9. Search\";\r\n    cout<<\"\\n 10. Count Node\";\r\n    cout<<\"\\n 11. 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:obj.create();break;\r\n        case 2:obj.display();break;\r\n        case 3:obj.insert_first();break;\r\n        case 4:obj.insert_middle();break;\r\n        case 5:obj.insert_last();break;\r\n        case 6:obj.delete_first();break;\r\n        case 7:obj.delete_middle();break;\r\n        case 8:obj.delete_last();break;\r\n        case 9:obj.search_data();break;\r\n        case 10:obj.count_node();break;\r\n         case 11:break;\r\n            default:cout<<\"\\n Invalid choice\";\r\n    }\r\n}while(choice!=11);\r\n    return 0;\r\n}<\/pre>\n
 <\/p>\n","protected":false},"excerpt":{"rendered":"
Program 1 \/\/ Circular Double Linked List #include<iostream> #include<stdio.h> using namespace std; class Node { Node *ladd; int data; Node *radd; public: void create(); void display(); void reverseDisplay(); void insert_first(); void insert_middle(); void insert_last();...<\/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":[32278,35324,35323,32874,35325,32869,32870,35326],"class_list":["post-146877","post","type-post","status-publish","format-standard","hentry","category-dsa-cpp-tutorials","tag-circular-doubly-linked-list","tag-circular-doubly-linked-list-in-c","tag-circular-doubly-linked-list-in-dsa-c","tag-dsa-c","tag-dsa-c-circular-doubly-linked-list","tag-dsa-c-practical","tag-dsa-c-program","tag-dsa-c-program-on-circular-doubly-linked-list"],"yoast_head":"\nCircular Doubly 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-doubly-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 Doubly Linked List in DSA C++ - DataFlair\" \/>\n<meta property=\"og:description\" content=\"Program 1 \/\/ Circular Double Linked List #include<iostream> #include<stdio.h> using namespace std; class Node { Node *ladd; int data; Node *radd; public: void create(); void display(); void reverseDisplay(); void insert_first(); void insert_middle(); void insert_last();...\" \/>\n<meta property=\"og:url\" content=\"https:\/\/data-flair.training\/blogs\/circular-doubly-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-19T10:26:58+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 Doubly 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-doubly-linked-list-in-dsa-cpp\/","og_locale":"en_US","og_type":"article","og_title":"Circular Doubly Linked List in DSA C++ - DataFlair","og_description":"Program 1 \/\/ Circular Double Linked List #include<iostream> #include<stdio.h> using namespace std; class Node { Node *ladd; int data; Node *radd; public: void create(); void display(); void reverseDisplay(); void insert_first(); void insert_middle(); void insert_last();...","og_url":"https:\/\/data-flair.training\/blogs\/circular-doubly-linked-list-in-dsa-cpp\/","og_site_name":"DataFlair","article_publisher":"https:\/\/www.facebook.com\/DataFlairWS\/","article_published_time":"2025-09-19T10:26:58+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-doubly-linked-list-in-dsa-cpp\/#article","isPartOf":{"@id":"https:\/\/data-flair.training\/blogs\/circular-doubly-linked-list-in-dsa-cpp\/"},"author":{"name":"DataFlair Team","@id":"https:\/\/data-flair.training\/blogs\/#\/schema\/person\/c187795dc82ab948373cca526df7c445"},"headline":"Circular Doubly Linked List in DSA C++","datePublished":"2025-09-19T10:26:58+00:00","mainEntityOfPage":{"@id":"https:\/\/data-flair.training\/blogs\/circular-doubly-linked-list-in-dsa-cpp\/"},"wordCount":9,"commentCount":0,"publisher":{"@id":"https:\/\/data-flair.training\/blogs\/#organization"},"keywords":["circular doubly linked list","circular doubly linked list in c++","circular doubly linked list in dsa c++","dsa c++","dsa c++ circular doubly linked list","dsa c++ practical","dsa c++ program","dsa c++ program on circular doubly linked list"],"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-cpp\/#respond"]}]},{"@type":"WebPage","@id":"https:\/\/data-flair.training\/blogs\/circular-doubly-linked-list-in-dsa-cpp\/","url":"https:\/\/data-flair.training\/blogs\/circular-doubly-linked-list-in-dsa-cpp\/","name":"Circular Doubly Linked List in DSA C++ - DataFlair","isPartOf":{"@id":"https:\/\/data-flair.training\/blogs\/#website"},"datePublished":"2025-09-19T10:26:58+00:00","breadcrumb":{"@id":"https:\/\/data-flair.training\/blogs\/circular-doubly-linked-list-in-dsa-cpp\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/data-flair.training\/blogs\/circular-doubly-linked-list-in-dsa-cpp\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/data-flair.training\/blogs\/circular-doubly-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 Doubly 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\/146877","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=146877"}],"version-history":[{"count":2,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/posts\/146877\/revisions"}],"predecessor-version":[{"id":146887,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/posts\/146877\/revisions\/146887"}],"wp:attachment":[{"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/media?parent=146877"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/categories?post=146877"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/tags?post=146877"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}