Node Insert(Node head,int data) {

    Node temp;
    Node temp1 = head;

    if(head == null) //if empty
    {
        temp = new Node();
        temp.data = data;
        temp.next = null;
        head = temp;

    }else
    {
        temp = new Node();
        temp.data = data;
        temp.next = null;
        Node previous = new Node();

        while(temp1 != null)//traversing the list
         {
                previous = temp1; //This is the LAST node
                temp1 = temp1.next; //strictly being used for traversal
         }

         previous.next = temp;
    }
    return head;
}