Reply to thread

Message

<blockquote data-quote="Anonymous_Abstract" data-source="post: 24659398" data-attributes="member: 568286">&nbsp; Single Linked List In Javapackage com.benz.test;import java.util.Scanner;class Node{&nbsp; &nbsp; int data;&nbsp; &nbsp; Node link;&nbsp; &nbsp; &nbsp; &nbsp; public Node(int data,Node link)&nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; this.data=data;&nbsp; &nbsp; &nbsp; &nbsp; this.link=link;&nbsp; &nbsp; }}public class SingleLinkedList {&nbsp; &nbsp; Node root=null;&nbsp; &nbsp; Scanner sc = null;&nbsp; &nbsp; &nbsp; &nbsp; public SingleLinkedList()&nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; sc = new Scanner(System.in);&nbsp; &nbsp; }&nbsp; &nbsp; public void details()&nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; while(true)&nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; System.out.println(&quot;1.append&quot;);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; System.out.println(&quot;2.begin&quot;);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; System.out.println(&quot;3.after&quot;);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; System.out.println(&quot;4.delete&quot;);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; System.out.println(&quot;5.display&quot;);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; System.out.println(&quot;6.swap&quot;);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; System.out.println(&quot;7.exit&quot;);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; int ch;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; System.out.println(&quot;Enter your choice&quot;);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; ch = sc.nextInt();&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; switch(ch)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; case 1:append();break;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; case 2:begin();break;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; case 3:after();break;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; case 4:delete();break;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; case 5:display();break;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; case 6:swap();break;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; case 7:System.exit(4);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; default:System.out.println(&quot;Invalid Input&quot;);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; public void append()&nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; Node temp;&nbsp; &nbsp; &nbsp; &nbsp;&nbsp; System.out.println(&quot;Enter a Value&quot;);&nbsp; &nbsp; &nbsp; &nbsp;&nbsp; int value = sc.nextInt();&nbsp; &nbsp; &nbsp; &nbsp;&nbsp; temp = new Node(value,null);&nbsp; &nbsp; &nbsp; &nbsp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; if(root==null)&nbsp; &nbsp; &nbsp; &nbsp;&nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; root=temp;&nbsp; &nbsp; &nbsp; &nbsp;&nbsp; }else&nbsp; &nbsp; &nbsp; &nbsp;&nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; Node p;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; p=root;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; while(p.link != null)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; p= p.link;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; p.link=temp;&nbsp; &nbsp; &nbsp; &nbsp;&nbsp; }&nbsp; &nbsp; }&nbsp; &nbsp; public void begin()&nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; Node temp;&nbsp; &nbsp; &nbsp; &nbsp;&nbsp; System.out.println(&quot;Enter a Value&quot;);&nbsp; &nbsp; &nbsp; &nbsp;&nbsp; int value = sc.nextInt();&nbsp; &nbsp; &nbsp; &nbsp;&nbsp; temp = new Node(value,null);&nbsp; &nbsp; &nbsp; &nbsp;&nbsp; if(root==null)&nbsp; &nbsp; &nbsp; &nbsp;&nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; root=temp;&nbsp; &nbsp; &nbsp; &nbsp;&nbsp; }else {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; temp.link=root;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; root =temp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; }&nbsp; &nbsp; }&nbsp; &nbsp; public void after()&nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; int loc;&nbsp; &nbsp; &nbsp; &nbsp; System.out.println(&quot;Enter the location to add node&quot;);&nbsp; &nbsp; &nbsp; &nbsp; loc = sc.nextInt();&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if(loc&gt;=length())&nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; System.out.println(&quot;Invalid location&quot;);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; System.out.println(&quot;Current node is &quot;+length());&nbsp; &nbsp; &nbsp; &nbsp; }else {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Node temp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; System.out.println(&quot;Enter a Value&quot;);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; int value = sc.nextInt();&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; temp = new Node(value,null);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; Node p=root;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; int i=1;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; while(i&lt;loc)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; p =p.link;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; i++;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; temp.link=p.link;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; p.link=temp;&nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; public void delete()&nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; if(root==null) {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; System.out.println(&quot;No nodes in the list&quot;);&nbsp; &nbsp; &nbsp; &nbsp; }else&nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; int loc;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; System.out.println(&quot;Enter the location to delete node&quot;);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; loc = sc.nextInt();&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; Node temp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if(loc&gt;length())&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; System.out.println(&quot;Invalid location&quot;);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; System.out.println(&quot;Current node is &quot;+length());&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }else if(loc==1)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; temp =root;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; root = temp.link;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; temp.link=null;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }else {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; int i=1;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; temp=root;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Node p;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; while(i&lt;loc-1)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; temp=temp.link;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; i++;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; p = temp.link;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; temp.link = p.link;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; p.link=null;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; }&nbsp; &nbsp; public void display()&nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; Node temp =root;&nbsp; &nbsp; &nbsp; &nbsp; if(root==null)&nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; System.out.println(&quot;No nodes in the list&quot;);&nbsp; &nbsp; &nbsp; &nbsp; }else {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; while(temp != null)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; System.out.print(temp.data+&quot;--&gt;\t&quot;);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; temp=temp.link;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; System.out.print(&quot;\n&quot;);&nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; }&nbsp; &nbsp; public int length()&nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; int len=0;&nbsp; &nbsp; &nbsp; &nbsp; Node temp =root;&nbsp; &nbsp; &nbsp; &nbsp; if(temp == null)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; return len;&nbsp; &nbsp; &nbsp; &nbsp; else {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; while(temp !=null)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; len +=1;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; temp = temp.link;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; return len;&nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; public void swap()&nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; Node temp = root;&nbsp; &nbsp; &nbsp; &nbsp; if(root==null)&nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; System.out.println(&quot;No nodes in the list&quot;);&nbsp; &nbsp; &nbsp; &nbsp; }else {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; int loc;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; System.out.println(&quot;Enter the location to swap node&quot;);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; loc = sc.nextInt();&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if(loc&gt;=length())&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; System.out.println(&quot;Invalid location&quot;);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; System.out.println(&quot;Current node is &quot;+length());&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }else if(loc==1)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; //System.out.println(&quot;Invalid Location&quot;);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Node p,q,r;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; p=temp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; q=p.link;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; r=q.link;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; p.link=r;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; q.link=p;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; root =q;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }else {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; Node p,q,r;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; p=temp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; int i=1;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; while(i&lt;loc-1)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; p=p.link;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; i++;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; q =p.link;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; r=q.link;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; q.link= r.link;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; r.link=q;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; p.link = r;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; }&nbsp; &nbsp; public static void main(String[] args) {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; SingleLinkedList li =new SingleLinkedList();&nbsp; &nbsp; &nbsp; &nbsp;&nbsp; li.details();&nbsp; &nbsp; }}</blockquote>

[QUOTE="Anonymous_Abstract, post: 24659398, member: 568286"] [SIZE="5"] Single Linked List In Java[/SIZE] [SIZE="4"][COLOR="Blue"]package com.benz.test; import java.util.Scanner; class Node{ int data; Node link; public Node(int data,Node link) { this.data=data; this.link=link; } } public class SingleLinkedList { Node root=null; Scanner sc = null; public SingleLinkedList() { sc = new Scanner(System.in); } public void details() { while(true) { System.out.println("1.append"); System.out.println("2.begin"); System.out.println("3.after"); System.out.println("4.delete"); System.out.println("5.display"); System.out.println("6.swap"); System.out.println("7.exit"); int ch; System.out.println("Enter your choice"); ch = sc.nextInt(); switch(ch) { case 1:append();break; case 2:begin();break; case 3:after();break; case 4:delete();break; case 5:display();break; case 6:swap();break; case 7:System.exit(4); default:System.out.println("Invalid Input"); } } } public void append() { Node temp; System.out.println("Enter a Value"); int value = sc.nextInt(); temp = new Node(value,null); if(root==null) { root=temp; }else { Node p; p=root; while(p.link != null) { p= p.link; } p.link=temp; } } public void begin() { Node temp; System.out.println("Enter a Value"); int value = sc.nextInt(); temp = new Node(value,null); if(root==null) { root=temp; }else { temp.link=root; root =temp; } } public void after() { int loc; System.out.println("Enter the location to add node"); loc = sc.nextInt(); if(loc>=length()) { System.out.println("Invalid location"); System.out.println("Current node is "+length()); }else { Node temp; System.out.println("Enter a Value"); int value = sc.nextInt(); temp = new Node(value,null); Node p=root; int i=1; while(i<loc) { p =p.link; i++; } temp.link=p.link; p.link=temp; } } public void delete() { if(root==null) { System.out.println("No nodes in the list"); }else { int loc; System.out.println("Enter the location to delete node"); loc = sc.nextInt(); Node temp; if(loc>length()) { System.out.println("Invalid location"); System.out.println("Current node is "+length()); }else if(loc==1) { temp =root; root = temp.link; temp.link=null; }else { int i=1; temp=root; Node p; while(i<loc-1) { temp=temp.link; i++; } p = temp.link; temp.link = p.link; p.link=null; } } } public void display() { Node temp =root; if(root==null) { System.out.println("No nodes in the list"); }else { while(temp != null) { System.out.print(temp.data+"-->\t"); temp=temp.link; } System.out.print("\n"); } } public int length() { int len=0; Node temp =root; if(temp == null) return len; else { while(temp !=null) { len +=1; temp = temp.link; } return len; } } public void swap() { Node temp = root; if(root==null) { System.out.println("No nodes in the list"); }else { int loc; System.out.println("Enter the location to swap node"); loc = sc.nextInt(); if(loc>=length()) { System.out.println("Invalid location"); System.out.println("Current node is "+length()); }else if(loc==1) { //System.out.println("Invalid Location"); Node p,q,r; p=temp; q=p.link; r=q.link; p.link=r; q.link=p; root =q; }else { Node p,q,r; p=temp; int i=1; while(i<loc-1) { p=p.link; i++; } q =p.link; r=q.link; q.link= r.link; r.link=q; p.link = r; } } } public static void main(String[] args) { SingleLinkedList li =new SingleLinkedList(); li.details(); } }[/COLOR][/SIZE] [/QUOTE]

Verification

Dawasata paya keeyak thibeda?

Search

Latest ads

Reply to thread