Link-List in Java

LinkedList

• Graph Of linking between Nodes

• Here we are going to implement List program with help of LinkedList Algorithms
• Main function should be Add_At_Position,Delete_From_Position,Display,GetSize,Sorting,etc.
• Main advantage of using link list is that it is dynamic.
• Here first we are going to make Node with help of Node class

import java.util.*; ///Node class for linking between to Data nodes class Node { public int Data; public Node Next; public Node(int data) { Data=data; Next=null; } public int GetData() {return Data;} } //Linked list class class LinkedList { private Node Head; private int SIZE; //contractor public LinkedList() { Head=null; SIZE = 0; } //General function for add data at any position public void Add_Data(int Pos,int Data) { Node Previous_Address=null; Node Dummy=Head; int counter=0; while(true) { if(Dummy!=null) { counter++; if(counter==Pos-1) { Previous_Address=Dummy; } if(counter==Pos) { Node n=new Node(Data); if(Pos==1) { n.Next=Head; Head=n; } else if(Pos==GetSize()) { Dummy.Next=n; } else { n.Next=Dummy; Dummy=n; Previous_Address.Next=Dummy; } break; } else { Dummy=Dummy.Next; } } else { if(GetSize()==0) { Node n=new Node(Data); n.Next=Head; Head=n; break; } } } System.out.println("\n\nSUCCESSFULLY ADDED IN LIST\n\n"); SIZE++; } //General function for deleting data from any position public void Delete_Data(int Pos) { Node Dummy=Head; Node Previous_Address=null; int counter=0; while(true) { if(Dummy!=null) { counter++; if(counter==Pos-1) { Previous_Address=Dummy; } if(counter==Pos) { if(Pos==1) { Head=Head.Next; } else { Dummy=Dummy.Next; Previous_Address.Next=Dummy; } SIZE--; break; } else { Dummy=Dummy.Next; } } else { System.out.println("\nYOU ENTER WRONG POSITION.\n\nOR DATA IS NOT AVAILABLE AT THAT POSITION."); break; } } } //Display function public void Display() { System.out.println("\n\t\t\t-----LIST-----\n\n"); Node Dummy=Head; while(true) { if(Dummy!=null) { System.out.println("\t\t\t\t"+Dummy.GetData()); Dummy=Dummy.Next; } else { break; } } } //Function for searching element's position by it's value. public int SearchElementByValue(int Value) { Node Dummy=Head; int counter=0; while(Dummy!=null) { counter++; if(Dummy.GetData()==Value) { return counter; } Dummy=Dummy.Next; } return -1; } //Function for searching position public int SearchByPosition(int Pos) { Node Dummy=Head; int counter=0; while(Dummy!=null) { counter++; if(counter==Pos) { break; } else { Dummy=Dummy.Next; } } if(Dummy!=null) return Dummy.GetData(); else return -1; } //For getting number of elements in list public int GetSize() { return SIZE; } //Function for sorting list public void Sorting() { System.out.println("\n\n\t\t\tSORTED LIST"); for(int i=1;i<GetSize();i++) { Node Dummy=Head; Node Dummy1=null; while(Dummy.Next!=null) { Dummy1 = Dummy; Dummy=Dummy.Next; if(Dummy.Data<Dummy1.Data) { int Temp=Dummy.GetData(); Dummy.Data=Dummy1.Data; Dummy1.Data=Temp; } } } } public void Reverce_List() { Node Dummy1=Head; for(int i=0;i<(SIZE/2);i++) { int counter=1; Node Dummy=Head; while(Dummy!=null) { if(counter==SIZE-i) { break; } else { counter++; Dummy=Dummy.Next; } } if(Dummy!=null) { int Temp=Dummy.Data; Dummy.Data=Dummy1.Data; Dummy1.Data=Temp; } Dummy1=Dummy1.Next; } System.out.println("Successfully Shifted All Elements."); } }