diff --git a/Single_Linked_List_Insertion.java b/Single_Linked_List_Insertion.java
new file mode 100644
index 0000000..7500d8d
--- /dev/null
+++ b/Single_Linked_List_Insertion.java
@@ -0,0 +1,80 @@
+import java.util.Scanner;
+
+public class Single_LL_Insertion {
+    Node head = null;
+
+    public Single_LL_Insertion() {
+    }
+
+    public void insertion() {
+        Scanner sc = new Scanner(System.in);
+
+        int n;
+        do {
+            System.out.println("Enter data: ");
+            int data = sc.nextInt();
+            Node new_node = new Node(data);
+            if (this.head == null) {
+                this.head = new_node;
+            } else {
+                System.out.println("Enter 1 to insert the item at the beginning, 2 to insert the item at the end, 3 to insert the item at any specific location");
+                int w = sc.nextInt();
+                switch (w) {
+                    case 1:
+                        new_node.next = this.head;
+                        this.head = new_node;
+                        break;
+                    case 2:
+                        Node check;
+                        for(check = this.head; check.next != null; check = check.next) {
+                        }
+
+                        check.next = new_node;
+                        break;
+                    case 3:
+                        Node tempins = this.head;
+                        System.out.println("Enter the data of the location after which you want to insert new node:");
+
+                        for(int insdat = sc.nextInt(); tempins.data != insdat; tempins = tempins.next) {
+                        }
+
+                        new_node.next = tempins.next;
+                        tempins.next = new_node;
+                }
+            }
+
+            System.out.println("Do you want to add more data?If 'Yes' press 0: ");
+            n = sc.nextInt();
+        } while(n == 0);
+
+    }
+
+    public void traverse() {
+        Node temp = this.head;
+        if (this.head == null) {
+            System.out.println("Linked List doesn't exist.");
+        } else {
+            while(temp != null) {
+                System.out.println(temp.data);
+                temp = temp.next;
+            }
+        }
+
+    }
+
+    public static void main(String[] args) {
+        Single_LL_Insertion s2 = new Single_LL_Insertion();
+        s2.insertion();
+        s2.traverse();
+    }
+
+    static class Node {
+        int data;
+        Node next;
+
+        Node(int data) {
+            this.data = data;
+            this.next = null;
+        }
+    }
+}