{"id":135961,"date":"2024-05-29T11:26:49","date_gmt":"2024-05-29T05:56:49","guid":{"rendered":"https:\/\/data-flair.training\/blogs\/?p=135961"},"modified":"2024-05-29T11:26:49","modified_gmt":"2024-05-29T05:56:49","slug":"how-to-display-linked-list-in-reverse-order-in-dsa-java","status":"publish","type":"post","link":"https:\/\/data-flair.training\/blogs\/how-to-display-linked-list-in-reverse-order-in-dsa-java\/","title":{"rendered":"How to Display Linked List in Reverse Order in DSA Java"},"content":{"rendered":"<h3>Program 1<\/h3>\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"generic\">import java.util.*;\r\nclass SingleLinkedList\r\n{\r\n      static class Node\r\n      {\r\n            int data;\r\n            Node add;    \r\n      }\r\n      Node start=null,new1,temp,next1,prev1;\r\n      void create()\r\n      {\r\n            start=new Node();\r\n            int n;\r\n            String choice;\r\n            Scanner scan=new Scanner(System.in);\r\n            System.out.println(\"Enter an element\");\r\n            n=scan.nextInt();\r\n            start.data=n;\r\n            start.add=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 next element\");\r\n                n=scan.nextInt();\r\n                new1=new Node();\r\n                new1.data=n;\r\n                new1.add=null;\r\n                temp.add=new1;\r\n                temp=temp.add;\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                while(temp!=null)\r\n                {\r\n                    System.out.print(temp.data + \"  \");\r\n                    temp=temp.add;\r\n                }\r\n             }\r\n\r\n      }\r\n       void reverseDisplay()\r\n      {\r\n             next1=start;\r\n             ArrayList&lt;Node&gt;mylist=new ArrayList&lt;Node&gt;();\r\n             while(next1!=null)\r\n             {\r\n                   mylist.add(next1);\r\n                   next1=next1.add;\r\n             }\r\n               for(int i=mylist.size()-1;i&gt;=0;i--)\r\n               {\r\n                  System.out.print(mylist.get(i).data + \"   \");    \r\n\r\n               }\r\n            \/\/ System.out.println(mylist.size());\r\n\r\n      }\r\n\r\n      void insertFirst()\r\n      {\r\n        int n;\r\n        Scanner scan=new Scanner(System.in);\r\n        if(start==null)\r\n             System.out.println(\"List not found\"); \r\n        else\r\n        {\r\n            new1=new Node();\r\n             System.out.println(\"Enter an element for insert\");\r\n             n=scan.nextInt();\r\n             new1.data=n;\r\n             new1.add=null;\r\n             new1.add=start;\r\n             start=new1;\r\n        }     \r\n      }\r\n\r\n      void insertMiddle()\r\n      {\r\n\r\n            int n,pos,i=1;\r\n           Scanner scan=new Scanner(System.in);\r\n       if(start==null)\r\n             System.out.println(\"List not found\"); \r\n        else\r\n        {\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.add=null;\r\n             System.out.println(\"Enter an position for insert\");\r\n             pos=scan.nextInt();\r\n             next1=start;\r\n             while(i&lt;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\n      }\r\n\r\n      void insertLast()\r\n      {\r\n\r\n            int n;\r\n           Scanner scan=new Scanner(System.in);\r\n       if(start==null)\r\n             System.out.println(\"List not found\"); \r\n        else\r\n        {\r\n            System.out.println(\"Enter an element for insert\");\r\n             n=scan.nextInt();\r\n\r\n            new1=new Node();\r\n              new1.data=n;\r\n              new1.add=null;\r\n             temp=start;\r\n             while(temp.add!=null)\r\n             {\r\n                temp=temp.add;\r\n             }\r\n             temp.add=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                  temp=start;\r\n                  start=start.add;\r\n                  System.out.println(\"Deleted node is \" + temp.data);\r\n                  temp=null;\r\n            }\r\n      }\r\n      void deleteLast()\r\n      {\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                      while(temp.add!=null)\r\n                      {\r\n                           prev1=temp;\r\n                           temp=temp.add;\r\n                      }\r\n                      prev1.add=null;\r\n                      System.out.println(\"Deleted node is \"+temp.data);\r\n                      temp.add=null;\r\n            }\r\n\r\n      }\r\n     \r\n      void deleteMiddle()\r\n      {\r\n            Scanner scan=new Scanner(System.in);\r\n          if(start==null)\r\n            System.out.println(\"List Not found..........\");\r\n            else\r\n            { \r\n                     int pos,i=1;\r\n                     System.out.println(\"Enter your choice\");\r\n                     pos=scan.nextInt();\r\n                     next1=start;\r\n                     while(i&lt;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                     System.out.println(\"Deleted node is : \" + temp.data);\r\n                     temp=null;\r\n\r\n            }\r\n\r\n      }\r\n       boolean searchData(int n)\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                 while(temp!=null)    \r\n                 {\r\n                     if(n==temp.data)\r\n                        return true;\r\n\r\n                     temp=temp.add;   \r\n                 }\r\n            }\r\n           return false; \r\n       }\r\n\r\n       void countNode()\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 count=0;\r\n                   temp=start;\r\n                   while(temp!=null)\r\n                   {\r\n                        count++;\r\n                        temp=temp.add;\r\n                   }\r\n                System.out.println(\"Total Node in List \"+count);  \r\n            }\r\n       }\r\n       void sortData()\r\n       {\r\n            prev1=start;\r\n            int t;\r\n            while(prev1!=null)\r\n            {\r\n                  next1=prev1.add;\r\n                  while(next1!=null)\r\n                  {\r\n                        if(next1.data&lt;prev1.data)\r\n                        {\r\n                               t=prev1.data;\r\n                               prev1.data=next1.data;\r\n                               next1.data=t;\r\n                        }\r\n                       next1=next1.add; \r\n                  }\r\n                 prev1=prev1.add; \r\n            }\r\n       }\r\n}\r\nclass TestList\r\n{\r\n    public static void main(String args[])\r\n    {\r\n        SingleLinkedList S=new SingleLinkedList();\r\n        Scanner scan=new Scanner(System.in);\r\n        \r\n        int ch,n;\r\n      do\r\n     {   \r\n        System.out.println(\"\\n-------------------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.Searching\");\r\n        System.out.println(\"10.Sorting\");\r\n        System.out.println(\"11.Reverse Display\");\r\n        System.out.println(\"12.Count Node\");\r\n        System.out.println(\"13.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:S.create();break;\r\n            case 2:S.display();break;\r\n            case 3:S.insertFirst();break;\r\n            case 4:S.insertMiddle();break;\r\n            case 5:S.insertLast();break;\r\n            case 6:S.deleteFirst();break;\r\n            case 7:S.deleteMiddle();break;\r\n            case 8:S.deleteLast();break;\r\n            case 9:\r\n                  {\r\n                      System.out.println(\"Enter an element for search in list\");\r\n                      n=scan.nextInt();  \r\n                       if(S.searchData(n))\r\n                          System.out.println(\"Searching success\");\r\n                        else\r\n                            System.out.println(\"Searching not success\");\r\n                     break;\r\n                  }\r\n            case 10:S.sortData();break;\r\n            case 11:S.reverseDisplay();break;\r\n            case 12:S.countNode();break;\r\n            case 13:break;\r\n            default: System.out.println(\"Invalid choice\");\r\n          }\r\n     }while(ch!=13); \r\n    }\r\n}<\/pre>\n<p>&nbsp;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Program 1 import java.util.*; class SingleLinkedList { static class Node { int data; Node add; } Node start=null,new1,temp,next1,prev1; void create() { start=new Node(); int n; String choice; Scanner scan=new Scanner(System.in); 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":[32295,32300,32290,32298,32293,32299],"class_list":["post-135961","post","type-post","status-publish","format-standard","hentry","category-dsa-java-tutorials","tag-data-structures-using-java","tag-display-linked-list-in-reverse-order-in-dsa-using-java","tag-dsa-using-java","tag-dsa-using-java-practicals","tag-dsa-using-java-program","tag-how-to-display-linked-list-in-reverse-order"],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v27.8 - https:\/\/yoast.com\/product\/yoast-seo-wordpress\/ -->\n<title>How to Display Linked List in Reverse Order in DSA Java - 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\/how-to-display-linked-list-in-reverse-order-in-dsa-java\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"How to Display Linked List in Reverse Order in DSA Java - DataFlair\" \/>\n<meta property=\"og:description\" content=\"Program 1 import java.util.*; class SingleLinkedList { static class Node { int data; Node add; } Node start=null,new1,temp,next1,prev1; void create() { start=new Node(); int n; String choice; Scanner scan=new Scanner(System.in); 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\/how-to-display-linked-list-in-reverse-order-in-dsa-java\/\" \/>\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-29T05:56:49+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":"How to Display Linked List in Reverse Order in DSA Java - 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\/how-to-display-linked-list-in-reverse-order-in-dsa-java\/","og_locale":"en_US","og_type":"article","og_title":"How to Display Linked List in Reverse Order in DSA Java - DataFlair","og_description":"Program 1 import java.util.*; class SingleLinkedList { static class Node { int data; Node add; } Node start=null,new1,temp,next1,prev1; void create() { start=new Node(); int n; String choice; Scanner scan=new Scanner(System.in); System.out.println(\"Enter an element\"); n=scan.nextInt();&#46;&#46;&#46;","og_url":"https:\/\/data-flair.training\/blogs\/how-to-display-linked-list-in-reverse-order-in-dsa-java\/","og_site_name":"DataFlair","article_publisher":"https:\/\/www.facebook.com\/DataFlairWS\/","article_published_time":"2024-05-29T05:56:49+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\/how-to-display-linked-list-in-reverse-order-in-dsa-java\/#article","isPartOf":{"@id":"https:\/\/data-flair.training\/blogs\/how-to-display-linked-list-in-reverse-order-in-dsa-java\/"},"author":{"name":"TechVidvan Team","@id":"https:\/\/data-flair.training\/blogs\/#\/schema\/person\/0e594f928e31fc96628ac40f6ae74f49"},"headline":"How to Display Linked List in Reverse Order in DSA Java","datePublished":"2024-05-29T05:56:49+00:00","mainEntityOfPage":{"@id":"https:\/\/data-flair.training\/blogs\/how-to-display-linked-list-in-reverse-order-in-dsa-java\/"},"wordCount":13,"commentCount":0,"publisher":{"@id":"https:\/\/data-flair.training\/blogs\/#organization"},"keywords":["data structures using java","display linked list in reverse order in dsa using java","dsa using java","dsa using java practicals","dsa using java program","how to display linked list in reverse order"],"articleSection":["DSA using Java Tutorials"],"inLanguage":"en-US","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/data-flair.training\/blogs\/how-to-display-linked-list-in-reverse-order-in-dsa-java\/#respond"]}]},{"@type":"WebPage","@id":"https:\/\/data-flair.training\/blogs\/how-to-display-linked-list-in-reverse-order-in-dsa-java\/","url":"https:\/\/data-flair.training\/blogs\/how-to-display-linked-list-in-reverse-order-in-dsa-java\/","name":"How to Display Linked List in Reverse Order in DSA Java - DataFlair","isPartOf":{"@id":"https:\/\/data-flair.training\/blogs\/#website"},"datePublished":"2024-05-29T05:56:49+00:00","breadcrumb":{"@id":"https:\/\/data-flair.training\/blogs\/how-to-display-linked-list-in-reverse-order-in-dsa-java\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/data-flair.training\/blogs\/how-to-display-linked-list-in-reverse-order-in-dsa-java\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/data-flair.training\/blogs\/how-to-display-linked-list-in-reverse-order-in-dsa-java\/#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":"How to Display Linked List in Reverse Order in DSA Java"}]},{"@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\/135961","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=135961"}],"version-history":[{"count":4,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/posts\/135961\/revisions"}],"predecessor-version":[{"id":142589,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/posts\/135961\/revisions\/142589"}],"wp:attachment":[{"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/media?parent=135961"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/categories?post=135961"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/tags?post=135961"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}