diff --git a/linklist.java b/linklist.java
new file mode 100644
index 0000000..9713f78
--- /dev/null
+++ b/linklist.java
@@ -0,0 +1,121 @@
+class LinkedList 
+{ 
+    Node head;  // head of list 
+  
+    /* Linked list Node*/
+    class Node 
+    { 
+        int data; 
+        Node next; 
+        Node(int d) {data = d; next = null; } 
+    } 
+  
+    /* Inserts a new Node at front of the list. */
+    public void push(int new_data) 
+    { 
+        /* 1 & 2: Allocate the Node & 
+                  Put in the data*/
+        Node new_node = new Node(new_data); 
+  
+        /* 3. Make next of new Node as head */
+        new_node.next = head; 
+  
+        /* 4. Move the head to point to new Node */
+        head = new_node; 
+    } 
+  
+    /* Inserts a new node after the given prev_node. */
+    public void insertAfter(Node prev_node, int new_data) 
+    { 
+        /* 1. Check if the given Node is null */
+        if (prev_node == null) 
+        { 
+            System.out.println("The given previous node cannot be null"); 
+            return; 
+        } 
+  
+        /* 2 & 3: Allocate the Node & 
+                  Put in the data*/
+        Node new_node = new Node(new_data); 
+  
+        /* 4. Make next of new Node as next of prev_node */
+        new_node.next = prev_node.next; 
+  
+        /* 5. make next of prev_node as new_node */
+        prev_node.next = new_node; 
+    } 
+     
+    /* Appends a new node at the end.  This method is  
+       defined inside LinkedList class shown above */
+    public void append(int new_data) 
+    { 
+        /* 1. Allocate the Node & 
+           2. Put in the data 
+           3. Set next as null */
+        Node new_node = new Node(new_data); 
+  
+        /* 4. If the Linked List is empty, then make the 
+              new node as head */
+        if (head == null) 
+        { 
+            head = new Node(new_data); 
+            return; 
+        } 
+  
+        /* 4. This new node is going to be the last node, so 
+              make next of it as null */
+        new_node.next = null; 
+  
+        /* 5. Else traverse till the last node */
+        Node last = head;  
+        while (last.next != null) 
+            last = last.next; 
+  
+        /* 6. Change the next of last node */
+        last.next = new_node; 
+        return; 
+    } 
+  
+    /* This function prints contents of linked list starting from 
+        the given node */
+    public void printList() 
+    { 
+        Node tnode = head; 
+        while (tnode != null) 
+        { 
+            System.out.print(tnode.data+" "); 
+            tnode = tnode.next; 
+        } 
+    } 
+  
+    /* Driver program to test above functions. Ideally this function 
+       should be in a separate user class.  It is kept here to keep 
+       code compact */
+    public static void main(String[] args) 
+    { 
+        /* Start with the empty list */
+        LinkedList llist = new LinkedList(); 
+  
+        // Insert 6.  So linked list becomes 6->NUllist 
+        llist.append(6); 
+  
+        // Insert 7 at the beginning. So linked list becomes 
+        // 7->6->NUllist 
+        llist.push(7); 
+  
+        // Insert 1 at the beginning. So linked list becomes 
+        // 1->7->6->NUllist 
+        llist.push(1); 
+  
+        // Insert 4 at the end. So linked list becomes 
+        // 1->7->6->4->NUllist 
+        llist.append(4); 
+  
+        // Insert 8, after 7. So linked list becomes 
+        // 1->7->8->6->4->NUllist 
+        llist.insertAfter(llist.head.next, 8); 
+  
+        System.out.println("\nCreated Linked list is: "); 
+        llist.printList(); 
+    } 
+} 
\ No newline at end of file
diff --git a/sortlinklist.java b/sortlinklist.java
new file mode 100644
index 0000000..94a901c
--- /dev/null
+++ b/sortlinklist.java
@@ -0,0 +1,130 @@
+import java.util.*; 
+  
+/* Link list node */
+class Node  
+{ 
+    int data; 
+    Node next; 
+    Node(int d) {data = d; 
+                 next = null;} 
+} 
+      
+class MergeLists  
+{ 
+Node head;  
+  
+/* Method to insert a node at  
+   the end of the linked list */
+public void addToTheLast(Node node)  
+{ 
+    if (head == null) 
+    { 
+        head = node; 
+    } 
+    else 
+    { 
+        Node temp = head; 
+        while (temp.next != null) 
+            temp = temp.next; 
+        temp.next = node; 
+    } 
+} 
+  
+/* Method to print linked list */
+void printList() 
+{ 
+    Node temp = head; 
+    while (temp != null) 
+    { 
+        System.out.print(temp.data + " "); 
+        temp = temp.next; 
+    }  
+    System.out.println(); 
+} 
+  
+  
+// Driver Code 
+public static void main(String args[]) 
+{ 
+    /* Let us create two sorted linked 
+       lists to test the methods  
+       Created lists: 
+           llist1: 5->10->15, 
+           llist2: 2->3->20 
+    */
+    MergeLists llist1 = new MergeLists(); 
+    MergeLists llist2 = new MergeLists(); 
+      
+    // Node head1 = new Node(5); 
+    llist1.addToTheLast(new Node(5)); 
+    llist1.addToTheLast(new Node(10)); 
+    llist1.addToTheLast(new Node(15)); 
+      
+    // Node head2 = new Node(2); 
+    llist2.addToTheLast(new Node(2)); 
+    llist2.addToTheLast(new Node(3)); 
+    llist2.addToTheLast(new Node(20)); 
+      
+      
+    llist1.head = new Gfg().sortedMerge(llist1.head,  
+                                        llist2.head); 
+    llist1.printList();   
+      
+} 
+} 
+  
+class Gfg 
+{ 
+/* Takes two lists sorted in  
+increasing order, and splices  
+their nodes together to make  
+one big sorted list which is  
+returned. */
+Node sortedMerge(Node headA, Node headB) 
+{ 
+      
+    /* a dummy first node to  
+       hang the result on */
+    Node dummyNode = new Node(0); 
+      
+    /* tail points to the  
+    last result node */
+    Node tail = dummyNode; 
+    while(true)  
+    { 
+          
+        /* if either list runs out,  
+        use the other list */
+        if(headA == null) 
+        { 
+            tail.next = headB; 
+            break; 
+        } 
+        if(headB == null) 
+        { 
+            tail.next = headA; 
+            break; 
+        } 
+          
+        /* Compare the data of the two 
+        lists whichever lists' data is  
+        smaller, append it into tail and 
+        advance the head to the next Node 
+        */
+        if(headA.data <= headB.data) 
+        { 
+            tail.next = headA; 
+            headA = headA.next; 
+        }  
+        else
+        { 
+            tail.next = headB; 
+            headB = headB.next; 
+        } 
+          
+        /* Advance the tail */
+        tail = tail.next; 
+    } 
+    return dummyNode.next; 
+} 
+} 
\ No newline at end of file