Insert a Node at the Tail of a Linked List

                            Solution in C :

In C:

// The following part of code is all you need to complete the challenge in
//hackerrank. Rest is already coded there.

SinglyLinkedListNode* insertNodeAtTail(SinglyLinkedListNode* head, int data) {
         SinglyLinkedListNode* tem = head;
         SinglyLinkedListNode * t = (SinglyLinkedList*)malloc(sizeof(SinglyLinkedList));
         
         t->data = data;
         t->next = NULL;
    if(head == NULL){
        head = t;
        return head;
    }
         while(tem->next != NULL){
             tem = tem->next;
         }
        tem->next = t;
     return head;

}







In C++:

// The following function is all you need to complete the challenge in 
//hackerrank platform 

Node* Insert(Node *head,int data)
{
    Node * temp=head;
    Node * newN=new Node;
    newN->next=NULL;
    newN->data=data;
    if(temp==NULL)
        return newN;
    while(temp->next!=NULL)
        temp=temp->next;
    temp->next=newN;
    return head;
}







In Java:

//The following method is all you need to complete the challenge in 
//hackerrank platform

 static SinglyLinkedListNode insertNodeAtTail(SinglyLinkedListNode head, int data) {
        SinglyLinkedListNode newNode = new SinglyLinkedListNode(data);
        if(head == null){
            return newNode;
        }
        SinglyLinkedListNode cur = head;
        while(cur.next != null){
            cur = cur.next; 
        }
        cur.next = newNode;
        return head;
    }







In Python 3:

# The following method is all that id needed to complete the
# challenge in hackerrank.

def Insert(head, data):
    if head is None:
        return Node(data)
    pnt = head
    while pnt.next:
        pnt = pnt.next
    pnt.next = Node(data)
    return head