{"id":135950,"date":"2024-05-31T10:43:29","date_gmt":"2024-05-31T05:13:29","guid":{"rendered":"https:\/\/data-flair.training\/blogs\/?p=135950"},"modified":"2024-05-31T10:43:29","modified_gmt":"2024-05-31T05:13:29","slug":"circular-doubly-linked-list-in-dsa-java-part-2","status":"publish","type":"post","link":"https:\/\/data-flair.training\/blogs\/circular-doubly-linked-list-in-dsa-java-part-2\/","title":{"rendered":"Circular Doubly Linked List in DSA Java Part &#8211; 2"},"content":{"rendered":"<h3>Program 1<\/h3>\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"generic\">import java.util.*;\r\nclass CircularDoubleLinkedList\r\n{\r\n       static class Node\r\n       {\r\n             Node ladd;\r\n             int data;\r\n             Node radd;\r\n       }\r\n       Node start=null,new1,prev1,next1,temp,last;\r\n       void create()\r\n       {\r\n             Scanner scan=new Scanner(System.in);\r\n             int n;\r\n             String choice;\r\n             System.out.println(\"Enter an element\");\r\n             n=scan.nextInt();\r\n             start=new Node();\r\n             start.ladd=null;\r\n             start.data=n;\r\n             start.radd=null;\r\n             temp=start;\r\n             System.out.println(\"Want to continue\");\r\n              choice=scan.next();\r\n              while(choice.toUpperCase().equals(\"Y\"))\r\n              {\r\n                System.out.println(\"Enter an element\");\r\n                 n=scan.nextInt();\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                 start.ladd=new1;\r\n                 new1.radd=start;\r\n                 temp=temp.radd;\r\n                 System.out.println(\"Want to continue\");\r\n                 choice=scan.next();\r\n              }\r\n       }\r\n       void display()\r\n       {\r\n            if(start==null)\r\n            System.out.println(\"**********List Not Found***************\");\r\n            else\r\n            {\r\n                temp=start;\r\n                do\r\n              {\r\n                    System.out.print(temp.data + \"   \");\r\n                    temp=temp.radd;\r\n              }while(temp!=start);\r\n            }\r\n       }\r\n       void insertFirst()\r\n       {\r\n               if(start==null)\r\n                 System.out.println(\"**********List Not Found***************\");\r\n               else\r\n               {\r\n                    int n;\r\n                      Scanner scan=new Scanner(System.in);\r\n                       System.out.println(\"Enter an element\");\r\n                       n=scan.nextInt();\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       }\r\n       void insertLast()\r\n       {\r\n\r\n             if(start==null)\r\n                 System.out.println(\"**********List Not Found***************\");\r\n               else\r\n               {\r\n                    int n;\r\n                      Scanner scan=new Scanner(System.in);\r\n                       System.out.println(\"Enter an element\");\r\n                       n=scan.nextInt();\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                      new1.radd=start;\r\n                      start.ladd=new1;\r\n               }     \r\n\r\n       }\r\n       void insertMiddle()\r\n       {\r\n               if(start==null)\r\n                  System.out.println(\"***********List not Found*************\");\r\n               else\r\n               {\r\n                     Scanner scan=new Scanner(System.in);\r\n                     int n,pos,i;\r\n                     System.out.println(\"Enter an element for insert\");\r\n                     n=scan.nextInt();\r\n                     new1=new Node();\r\n                     new1.data=n;\r\n                     new1.ladd=null;\r\n                     new1.radd=null;\r\n                     System.out.println(\"Enter poistion for insert\");\r\n                     pos=scan.nextInt();\r\n                     i=1;\r\n                     next1=start;\r\n                     while(i&lt;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=new1;\r\n               }          \r\n       }\r\n       void deleteFirst()\r\n       {\r\n              if(start==null)\r\n                System.out.println(\"*************List not found******************\");\r\n              else\r\n              {\r\n                   last=start.ladd;\r\n                   temp=start;\r\n                   start=start.radd;\r\n                   start.ladd=last;\r\n                   last.radd=start;\r\n                   System.out.println(\"Deleted node \"+ temp.data);\r\n                   temp=null;\r\n              }\r\n\r\n\r\n       }\r\n       void deleteLast()\r\n       {\r\n              if(start==null)\r\n                System.out.println(\"*************List not found******************\");\r\n              else\r\n              {\r\n                         last=start.ladd;\r\n                         prev1=last.ladd;\r\n                         prev1.radd=start;\r\n                         start.ladd=prev1;\r\n                         System.out.println(\"Deleted node is \" +last.data);\r\n                         last=null;\r\n\r\n              }\r\n\r\n       }\r\n       void deleteMiddle()\r\n          {\r\n               int i,pos;\r\n             if(start==null)\r\n                  System.out.println(\"***********List not Found*************\");\r\n               else\r\n               {\r\n                     Scanner scan=new Scanner(System.in);   \r\n                     System.out.println(\"Enter poisition of node for delete\");\r\n                     pos=scan.nextInt();   \r\n                        i=1;\r\n                        temp=start;\r\n                        while(i&lt;pos)\r\n                        {\r\n                              temp=temp.radd;\r\n                              i++;\r\n                        }\r\n                        prev1=temp.ladd;\r\n                        next1=temp.radd;\r\n                        prev1.radd=next1;\r\n                        next1.ladd=prev1;\r\n                         System.out.println(\"Deleted node \" + temp.data);\r\n                         temp=null;\r\n               }\r\n          }\r\n       void reversedisplay()\r\n       {\r\n             last=start.ladd;\r\n             prev1=last;\r\n             do\r\n             {\r\n                   System.out.print(prev1.data + \"   \");\r\n                   prev1=prev1.ladd;\r\n             }while(prev1!=last);\r\n       }\r\n} \r\n\r\nclass TestCircularDouble\r\n{\r\n        public static void main(String args[])\r\n    {\r\n        CircularDoubleLinkedList cd=new CircularDoubleLinkedList();\r\n\r\n        Scanner scan=new Scanner(System.in);\r\n        int ch;\r\n      do\r\n     {   \r\n        System.out.println(\"\\n-------------------Circluar Doubly Linked List-------------------\");\r\n        System.out.println(\"1.Create\");\r\n        System.out.println(\"2.Display\");\r\n        System.out.println(\"3.Insert First\");\r\n        System.out.println(\"4.Insert Middle\");\r\n        System.out.println(\"5.Insert Last\");\r\n        System.out.println(\"6.Delete First\");\r\n        System.out.println(\"7.Delete Middle\");\r\n        System.out.println(\"8.Delete Last\");\r\n        System.out.println(\"9.Reverse Display\");\r\n        System.out.println(\"10.Exit\");\r\n        System.out.println(\"\\n-------------------------------------------------------------------\\n\");\r\n         System.out.println(\"Enter your choice\");\r\n          ch=scan.nextInt();\r\n          switch(ch)\r\n          {\r\n            case 1:cd.create();break;\r\n            case 2:cd.display();break;\r\n            case 3:cd.insertFirst();break;\r\n            case 4:cd.insertMiddle();break;\r\n            case 5:cd.insertLast();break;\r\n            case 6:cd.deleteFirst();break;\r\n            case 7:cd.deleteMiddle();break;\r\n            case 8:cd.deleteLast();break;\r\n            case 9:cd.reversedisplay();\r\n            case 10:break;\r\n          }\r\n     }while(ch!=10); \r\n    }\r\n  }\r\n<\/pre>\n<p>&nbsp;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Program 1 import java.util.*; class CircularDoubleLinkedList { static class Node { Node ladd; int data; Node radd; } Node start=null,new1,prev1,next1,temp,last; void create() { Scanner scan=new Scanner(System.in); int n; String choice; System.out.println(&#8220;Enter an element&#8221;); n=scan.nextInt();&#46;&#46;&#46;<\/p>\n","protected":false},"author":86671,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[31451],"tags":[32278,32310,32311,32290,32294,32293],"class_list":["post-135950","post","type-post","status-publish","format-standard","hentry","category-dsa-java-tutorials","tag-circular-doubly-linked-list","tag-circular-doubly-linked-list-in-dsa-java","tag-data-structure-with-java","tag-dsa-using-java","tag-dsa-using-java-practical","tag-dsa-using-java-program"],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v27.8 - https:\/\/yoast.com\/product\/yoast-seo-wordpress\/ -->\n<title>Circular Doubly Linked List in DSA Java 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-java-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 Java Part - 2 - DataFlair\" \/>\n<meta property=\"og:description\" content=\"Program 1 import java.util.*; class CircularDoubleLinkedList { static class Node { Node ladd; int data; Node radd; } Node start=null,new1,prev1,next1,temp,last; void create() { Scanner scan=new Scanner(System.in); int n; String choice; System.out.println(&quot;Enter an element&quot;); n=scan.nextInt();&#046;&#046;&#046;\" \/>\n<meta property=\"og:url\" content=\"https:\/\/data-flair.training\/blogs\/circular-doubly-linked-list-in-dsa-java-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-31T05:13:29+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 Java 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-java-part-2\/","og_locale":"en_US","og_type":"article","og_title":"Circular Doubly Linked List in DSA Java Part - 2 - DataFlair","og_description":"Program 1 import java.util.*; class CircularDoubleLinkedList { static class Node { Node ladd; int data; Node radd; } Node start=null,new1,prev1,next1,temp,last; void create() { Scanner scan=new Scanner(System.in); int n; String choice; System.out.println(\"Enter an element\"); n=scan.nextInt();&#46;&#46;&#46;","og_url":"https:\/\/data-flair.training\/blogs\/circular-doubly-linked-list-in-dsa-java-part-2\/","og_site_name":"DataFlair","article_publisher":"https:\/\/www.facebook.com\/DataFlairWS\/","article_published_time":"2024-05-31T05:13:29+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-java-part-2\/#article","isPartOf":{"@id":"https:\/\/data-flair.training\/blogs\/circular-doubly-linked-list-in-dsa-java-part-2\/"},"author":{"name":"TechVidvan Team","@id":"https:\/\/data-flair.training\/blogs\/#\/schema\/person\/0e594f928e31fc96628ac40f6ae74f49"},"headline":"Circular Doubly Linked List in DSA Java Part &#8211; 2","datePublished":"2024-05-31T05:13:29+00:00","mainEntityOfPage":{"@id":"https:\/\/data-flair.training\/blogs\/circular-doubly-linked-list-in-dsa-java-part-2\/"},"wordCount":11,"commentCount":0,"publisher":{"@id":"https:\/\/data-flair.training\/blogs\/#organization"},"keywords":["circular doubly linked list","circular doubly linked list in dsa java","data structure with java","dsa using java","dsa using java practical","dsa using java program"],"articleSection":["DSA using Java Tutorials"],"inLanguage":"en-US","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/data-flair.training\/blogs\/circular-doubly-linked-list-in-dsa-java-part-2\/#respond"]}]},{"@type":"WebPage","@id":"https:\/\/data-flair.training\/blogs\/circular-doubly-linked-list-in-dsa-java-part-2\/","url":"https:\/\/data-flair.training\/blogs\/circular-doubly-linked-list-in-dsa-java-part-2\/","name":"Circular Doubly Linked List in DSA Java Part - 2 - DataFlair","isPartOf":{"@id":"https:\/\/data-flair.training\/blogs\/#website"},"datePublished":"2024-05-31T05:13:29+00:00","breadcrumb":{"@id":"https:\/\/data-flair.training\/blogs\/circular-doubly-linked-list-in-dsa-java-part-2\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/data-flair.training\/blogs\/circular-doubly-linked-list-in-dsa-java-part-2\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/data-flair.training\/blogs\/circular-doubly-linked-list-in-dsa-java-part-2\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Blog Home","item":"https:\/\/data-flair.training\/blogs\/"},{"@type":"ListItem","position":2,"name":"DSA using Java Tutorials","item":"https:\/\/data-flair.training\/blogs\/category\/dsa-java-tutorials\/"},{"@type":"ListItem","position":3,"name":"Circular Doubly Linked List in DSA Java Part &#8211; 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 &amp; 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\/135950","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=135950"}],"version-history":[{"count":4,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/posts\/135950\/revisions"}],"predecessor-version":[{"id":142601,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/posts\/135950\/revisions\/142601"}],"wp:attachment":[{"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/media?parent=135950"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/categories?post=135950"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/tags?post=135950"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}