Insert a Node at the Tail of a Linked List


Problem Statement :


You are given the pointer to the head node of a linked list and an integer to add to the list. Create a new node with the given integer. Insert this node at the tail of the linked list and return the head node of the linked list formed after inserting this new node. The given head pointer may be null, meaning that the initial list is empty.


Input Format:

You have to complete the SinglyLinkedListNode insertAtTail(SinglyLinkedListNode head, int data) method. It takes two arguments: the head of the linked list and the integer to insert at tail. You should not read any input from the stdin/console.

The input is handled by code editor and is as follows:
The first line contains an integer n, denoting the elements of the linked list.
The next n lines contain an integer each, denoting the element that needs to be inserted at tail.


Constraints:
    1. 1<=n<=1000
    2. 1<=list[i]<=1000



Solution :



title-img


                            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
                        








View More Similar Problems

Median Updates

The median M of numbers is defined as the middle number after sorting them in order if M is odd. Or it is the average of the middle two numbers if M is even. You start with an empty number list. Then, you can add numbers to the list, or remove existing numbers from it. After each add or remove operation, output the median. Input: The first line is an integer, N , that indicates the number o

View Solution →

Maximum Element

You have an empty sequence, and you will be given N queries. Each query is one of these three types: 1 x -Push the element x into the stack. 2 -Delete the element present at the top of the stack. 3 -Print the maximum element in the stack. Input Format The first line of input contains an integer, N . The next N lines each contain an above mentioned query. (It is guaranteed that each

View Solution →

Balanced Brackets

A bracket is considered to be any one of the following characters: (, ), {, }, [, or ]. Two brackets are considered to be a matched pair if the an opening bracket (i.e., (, [, or {) occurs to the left of a closing bracket (i.e., ), ], or }) of the exact same type. There are three types of matched pairs of brackets: [], {}, and (). A matching pair of brackets is not balanced if the set of bra

View Solution →

Equal Stacks

ou have three stacks of cylinders where each cylinder has the same diameter, but they may vary in height. You can change the height of a stack by removing and discarding its topmost cylinder any number of times. Find the maximum possible height of the stacks such that all of the stacks are exactly the same height. This means you must remove zero or more cylinders from the top of zero or more of

View Solution →

Game of Two Stacks

Alexa has two stacks of non-negative integers, stack A = [a0, a1, . . . , an-1 ] and stack B = [b0, b1, . . . , b m-1] where index 0 denotes the top of the stack. Alexa challenges Nick to play the following game: In each move, Nick can remove one integer from the top of either stack A or stack B. Nick keeps a running sum of the integers he removes from the two stacks. Nick is disqualified f

View Solution →

Largest Rectangle

Skyline Real Estate Developers is planning to demolish a number of old, unoccupied buildings and construct a shopping mall in their place. Your task is to find the largest solid area in which the mall can be constructed. There are a number of buildings in a certain two-dimensional landscape. Each building has a height, given by . If you join adjacent buildings, they will form a solid rectangle

View Solution →