└── Linked List
    ├── Single_LinkedList_AddData.java
    ├── Single_LinkedList_Delete.java
    ├── Single_LinkedList_Insert.java
    ├── Single_LinkedList_Merge.java
    ├── Single_LinkedList_Search.java
    ├── Single_LinkedList_Sort.java
    └── Single_LinkedList_Traverse.java


/Linked List/Single_LinkedList_AddData.java:
--------------------------------------------------------------------------------
 1 | import java.util.*;
 2 | class Node
 3 | {
 4 | int data;
 5 | Node next;
 6 | Node(int data,Node next)
 7 | {
 8 | this.data=data;
 9 | this.next=next;
10 | }
11 | }
12 | class Single_LinkedList_AddData
13 | {
14 | static void traverse(Node node)
15 | {
16 | while(node!=null)
17 | {
18 | System.out.println(node.data);
19 | node=node.next;
20 | }
21 | }
22 | public static void main(String str[])
23 | {
24 | int l;
25 | Node node=null;
26 | Node pt=null;
27 | Scanner sc=new Scanner(System.in);
28 | System.out.print("Enter number of datas:");
29 | l=sc.nextInt();
30 | for(int i=0;i<l;i++)
31 | {
32 | Node n=new Node(sc.nextInt(),null);
33 | if(node==null)
34 | {
35 | node=n;
36 | pt=node;
37 | }
38 | else
39 | {
40 | pt.next=n;
41 | pt=pt.next;
42 | }
43 | }
44 | System.out.println("Data added Successfully!");
45 | traverse(node);
46 | }
47 | }
48 | 


--------------------------------------------------------------------------------
/Linked List/Single_LinkedList_Delete.java:
--------------------------------------------------------------------------------
 1 | import java.util.*;
 2 | class Node
 3 | {
 4 | int data;
 5 | Node next;
 6 | Node(int data,Node next)
 7 | {
 8 | this.data=data;
 9 | this.next=next;
10 | }
11 | }
12 | class Single_LinkedList_Delete
13 | {
14 | static void delete(Node h,int p)
15 | {
16 | if(p==0)
17 | {
18 | if(h.next!=null)
19 | {
20 | h.data=h.next.data;
21 | h.next=h.next.next;
22 | }
23 | else
24 | {
25 | h.data=0;
26 | }
27 | return;
28 | }
29 | for(int i=0;i<p-1;i++)
30 | {
31 | h=h.next;
32 | }
33 | if(h.next.next!=null)
34 | {
35 | h.next=h.next.next;
36 | }
37 | else
38 | {
39 | h.next=null;
40 | }
41 | }
42 | static void traverse(Node h)
43 | {
44 | while(h!=null)
45 | {
46 | System.out.println(h.data);
47 | h=h.next;
48 | }
49 | }
50 | public static void main(String str[])
51 | {
52 | Node h=null,t=null;
53 | int n,p;
54 | Scanner sc=new Scanner(System.in);
55 | System.out.print("Enter the total number of elements :");
56 | n=sc.nextInt();
57 | System.out.println("Enter the elements :");
58 | for(int i=0;i<n;i++)
59 | {
60 | Node nn=new Node(sc.nextInt(),null);
61 | if(h==null)
62 | {
63 | h=nn;
64 | t=h;
65 | }
66 | else
67 | {
68 | t.next=nn;
69 | t=t.next;
70 | }
71 | }
72 | System.out.print("Enter the position of number to delete :");
73 | p=sc.nextInt();
74 | delete(h,p);
75 | traverse(h);
76 | }
77 | }


--------------------------------------------------------------------------------
/Linked List/Single_LinkedList_Insert.java:
--------------------------------------------------------------------------------
 1 | import java.util.*;
 2 | class Node
 3 | {
 4 | int data;
 5 | Node next;
 6 | Node(int data,Node next)
 7 | {
 8 | this.data=data;
 9 | this.next=next;
10 | }
11 | }
12 | class Single_LinkedList_Insert
13 | {
14 | static void insert(Node n,int ne,int p)
15 | {
16 | Node pt=n;
17 | int i,f=0;
18 | if(p==0)
19 | {
20 | int a=n.data;
21 | Node nn=new Node(a,null);
22 | n.data=ne;
23 | nn.next=n.next;
24 | n.next=nn;
25 | f=1;
26 | }
27 | else
28 | {
29 | for(i=0;i<p-1;i++)
30 | {
31 | if(pt!=null && pt.next.next!=null)
32 | {
33 | pt=pt.next;
34 | }
35 | else
36 | {
37 | System.out.println("Index out of range");
38 | f=1;
39 | break;
40 | }
41 | }
42 | if(f==0)
43 | {
44 | Node nn=new Node(ne,null);
45 | nn.next=pt.next;
46 | pt.next=nn;
47 | System.out.println("Data insert at position "+p+" successfully!");
48 | }
49 | }
50 | }
51 | static void traverse(Node n)
52 | {
53 | Node pt=n;
54 | System.out.println("Elements are:");
55 | while(pt!=null)
56 | {
57 | System.out.println(pt.data);
58 | pt=pt.next;
59 | }
60 | }
61 | public static void main(String str[])
62 | {
63 | int l;
64 | Node n=null;
65 | Node t=null;
66 | Scanner sc=new Scanner(System.in);
67 | System.out.print("Enter the no.of elements:");
68 | l=sc.nextInt();
69 | System.out.println("Enter elements:");
70 | for(int i=0;i<l;i++)
71 | {
72 | int data=sc.nextInt();
73 | Node nn=new Node(data,null);
74 | if(n==null)
75 | {
76 | n=nn;
77 | t=n;
78 | }
79 | else
80 | {
81 | t.next=nn;
82 | t=t.next;
83 | }
84 | }
85 | System.out.println("Data Added Successfully!");
86 | System.out.print("Enter the new element to insert:");
87 | int ne=sc.nextInt();
88 | System.out.print("Enter the position to be insert:");
89 | int p=sc.nextInt();
90 | insert(n,ne,p);
91 | traverse(n);
92 | }
93 | }


--------------------------------------------------------------------------------
/Linked List/Single_LinkedList_Merge.java:
--------------------------------------------------------------------------------
 1 | import java.util.*;
 2 | class Node
 3 | {
 4 | int data;
 5 | Node next;
 6 | Node(int data,Node next)
 7 | {
 8 | this.data=data;
 9 | this.next=next;
10 | }
11 | }
12 | class Single_LinkedList_Merge
13 | {
14 | static void merge(Node h1,Node h2)
15 | {
16 | while(h1.next!=null)
17 | {
18 | h1=h1.next;
19 | }
20 | h1.next=h2;
21 | }
22 | static void traverse(Node h)
23 | {
24 | while(h!=null)
25 | {
26 | System.out.println(h.data);
27 | h=h.next;
28 | }
29 | }
30 | public static void main(String str[])
31 | {
32 | int n1,n2;
33 | Node h1=null,h2=null,t1=null,t2=null;
34 | Scanner sc=new Scanner(System.in);
35 | System.out.print("Enter the number of elements 1:");
36 | n1=sc.nextInt();
37 | System.out.print("Enter the number of elements 2:");
38 | n2=sc.nextInt();
39 | System.out.println("Enter the elements 1:");
40 | for(int i=0;i<n1;i++)
41 | {
42 | Node nn=new Node(sc.nextInt(),null);
43 | if(h1==null)
44 | {
45 | h1=nn;
46 | t1=h1;
47 | }
48 | else
49 | {
50 | t1.next=nn;
51 | t1=t1.next;
52 | }
53 | }
54 | System.out.println("Enter the elements 2:");
55 | for(int i=0;i<n2;i++)
56 | {
57 | Node nn=new Node(sc.nextInt(),null);
58 | if(h2==null)
59 | {
60 | h2=nn;
61 | t2=h2;
62 | }
63 | else
64 | {
65 | t2.next=nn;
66 | t2=t2.next;
67 | }
68 | }
69 | merge(h1,h2);
70 | traverse(h1);
71 | }
72 | }


--------------------------------------------------------------------------------
/Linked List/Single_LinkedList_Search.java:
--------------------------------------------------------------------------------
 1 | import java.util.*;
 2 | class Node
 3 | {
 4 | int data;
 5 | Node next;
 6 | Node(int data,Node next)
 7 | {
 8 | this.data=data;
 9 | this.next=next;
10 | }
11 | }
12 | class Single_LinkedList_Search
13 | {
14 | static void search(Node h,int e)
15 | {
16 | int f=0,i=0;
17 | while(h!=null)
18 | {
19 | if(h.data==e)
20 | {
21 | System.out.println("Element found at index "+i);
22 | f=1;
23 | break;
24 | }
25 | i++;
26 | h=h.next;
27 | }
28 | if(f==0)
29 | {
30 | System.out.println("Element not found");
31 | }
32 | }
33 | public static void main(String str[])
34 | {
35 | int n,e;
36 | Node h=null,t=null;
37 | Scanner sc=new Scanner(System.in);
38 | System.out.print("Enter the number of elements :");
39 | n=sc.nextInt();
40 | System.out.println("Enter the elements :");
41 | for(int i=0;i<n;i++)
42 | {
43 | Node nn=new Node(sc.nextInt(),null);
44 | if(h==null)
45 | {
46 | h=nn;
47 | t=h;
48 | }
49 | else
50 | {
51 | t.next=nn;
52 | t=t.next;
53 | }
54 | }
55 | System.out.print("Enter the search element :");
56 | e=sc.nextInt();
57 | search(h,e);
58 | }
59 | }


--------------------------------------------------------------------------------
/Linked List/Single_LinkedList_Sort.java:
--------------------------------------------------------------------------------
 1 | import java.util.*;
 2 | class Node
 3 | {
 4 | int data;
 5 | Node next;
 6 | Node(int data,Node next)
 7 | {
 8 | this.data=data;
 9 | this.next=next;
10 | }
11 | }
12 | class Single_LinkedList_Sort
13 | {
14 | static void sort(Node h)
15 | {
16 | while(h!=null)
17 | {
18 | Node t=h.next;
19 | while(t!=null)
20 | {
21 | if(t.data<h.data)
22 | {
23 | int temp=h.data;
24 | h.data=t.data;
25 | t.data=temp;
26 | }
27 | t=t.next;
28 | }
29 | h=h.next;
30 | }
31 | }
32 | static void traverse(Node h)
33 | {
34 | while(h!=null)
35 | {
36 | System.out.println(h.data);
37 | h=h.next;
38 | }
39 | }
40 | public static void main(String str[])
41 | {
42 | int n;
43 | Node h=null,t=null;
44 | Scanner sc=new Scanner(System.in);
45 | System.out.print("Enter the number of elements :");
46 | n=sc.nextInt();
47 | System.out.println("Enter the elements :");
48 | for(int i=0;i<n;i++)
49 | {
50 | Node nn=new Node(sc.nextInt(),null);
51 | if(h==null)
52 | {
53 | h=nn;
54 | t=h;
55 | }
56 | else
57 | {
58 | t.next=nn;
59 | t=t.next;
60 | }
61 | }
62 | sort(h);
63 | traverse(h);
64 | }
65 | }


--------------------------------------------------------------------------------
/Linked List/Single_LinkedList_Traverse.java:
--------------------------------------------------------------------------------
 1 | class Node
 2 | {
 3 | int data;
 4 | Node next;
 5 | }
 6 | class Single_LinkedList_Traverse
 7 | {
 8 | public static void traverse(Node n)
 9 | {
10 | while(n!=null)
11 | {
12 | System.out.println(n.data);
13 | n=n.next;
14 | }
15 | }
16 | public static void main(String str[])
17 | {
18 | Node n1=new Node();
19 | Node n2=new Node();
20 | Node n3=new Node();
21 | Node n4=new Node();
22 | Node n5=new Node();
23 | n1.data=10;
24 | n2.data=20;
25 | n3.data=30;
26 | n4.data=40;
27 | n5.data=50;
28 | n1.next=n2;
29 | n2.next=n3;
30 | n3.next=n4;
31 | n4.next=n5;
32 | n5.next=null;
33 | traverse(n1);
34 | }
35 | }


--------------------------------------------------------------------------------