sortedAddLL

class Node{
    int data;
    Node next;

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

public class SortLL {
    Node head;
    Node compare(Node n, Node new1){
        Node d1 = n;
        Node d2 = n.next;
        if(new1.data>n.data){
            return n.next;
        }
        else
            return n;

    }
    public void addInOrder(int key){
       Node current;
       Node new1 = new Node(key);

       if(head==null || head.data>=key){
           new1.next = head;
           head = new1;
       }
       else{
           current = head;
           while(current.next!=null && current.next.data<key){
               current = current.next;

           }
           new1.next = current.next;
           current.next=new1;
       }

    }
    public static void main(String args[]){
        SortLL l1 = new SortLL();
        l1.head = new Node(1);
        Node two = new Node(2);
        Node three = new Node(8);
        l1.head.next = two;
        two.next = three;
        l1.addInOrder(4);
        Node temp = l1.head;
        while(temp!=null){
            System.out.println(temp.data);
            temp=temp.next;
        }



    }

}