Data-Structures/swapynodes.java at master · ishitasinghal/Data-Structures · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
//swapping nodes of the linked list
class LinkedList
{
	Node head;
	class Node
	{
		int data;
		Node next;

		Node(int d)
		{
			data=d;
			next=null;
		}
	}

	void swapnodes(int a, int b)   //a and b are the nodes.
	{
		if(a==b)
		{
			return; //nodes are same
		}
		Node preva = null, currenta=head;
		while(currenta!=null && currenta!=a)
		{
			preva = currenta;
			currenta = currenta.next;
		}
	}


	public static void main(String args[])
	{
		LinkedList dn = new LinkedList();
		dn.insert(10);
		dn.insert(20);
        dn.insert(13);
        dn.insert(13);
        dn.insert(11);
        dn.insert(11);
        dn.insert(11);

        System.out.println("BEFORE REMOVAL: ");
        dn.print();
        dn.duplicates();
        System.out.println("AFTER REMOVAL: ");
        dn.print();
	}
}