We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Practice
  2. Data Structures
  3. Linked Lists
  4. Insert a Node at the Tail of a Linked List
  5. Discussions

Insert a Node at the Tail of a Linked List

  • abbhishek971 + 8 comments

    This is my solution in C++14

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

    • arkaguin + 0 comments

      thanks

    • neeraj1515_kaus1 + 1 comment

      what is the difference bet Node* temp and Node *temp.?

      • abbhishek971 + 0 comments

        Apologies for the delay in reply.

        There's no difference. Both the notations result in the same identifier declaration.

    • raghuvendra867 + 0 comments

      bro can u explain ur code?

    • abhishekjoshi261 + 0 comments

      solution.cc:46:1: error: ‘Node’ does not name a type; did you mean ‘modf’? Node* Insert(Node head,int data) ^~~~ modf solution.cc: In function ‘int main()’: solution.cc:83:41: error: ‘insertNodeAtTail’ was not declared in this scope SinglyLinkedListNode llist_head = insertNodeAtTail(llist->head, llist_item);

              showing this error code not working

    • shubhvratj + 6 comments

      SinglyLinkedListNode* insertNodeAtTail(SinglyLinkedListNode* head, int data) {

          SinglyLinkedListNode *new_node,*ptr;
    new_node = new SinglyLinkedListNode();
    new_node->data = data;
    new_node->next = NULL;
    if(head == NULL){
        head = new_node;
        return head;
    }else{
        ptr = head;
        while(ptr != NULL){
            ptr = ptr->next;
        }
        ptr->next = new_node;
        new_node->next = NULL;
return head;    
    }

      }

      can you please help me with this code?

      • abhishekjoshi261 + 0 comments

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

        }

        bro i think you missed the struct function and above is the soln that worked for me pm me if you find any problem

      • asmitaverma + 0 comments
        [deleted]

      • asmitaverma + 4 comments

        Here's my solution in C++14. The class definition of SinglyLinkedListNode specifies that the constructor has an argument which is the data part of the node to be inserted.

        SinglyLinkedListNode* insertNodeAtTail(SinglyLinkedListNode* head, int num){

        SinglyLinkedListNode* node = new SinglyLinkedListNode(num);
node->data = num;
node->next = NULL;

if(head == NULL){
    head = node;
}

else{
    SinglyLinkedListNode* temp;
    temp = head;
    while(temp->next != NULL){
        temp = temp->next;
    }
    temp->next = node;
}

return head;

        }

        • anamalaii + 0 comments

          Thank you

        • alexey_chekhovi1 + 0 comments

          SinglyLinkedListNode* node = new SinglyLinkedListNode(num);

          Works.

          SinglyLinkedListNode *newNode = new SinglyLinkedListNode();

          solution.cc:61:62: error: no matching function for call to ‘SinglyLinkedListNode::SinglyLinkedListNode()

          So we do not have an empty constructor, but do have a constructor with parameters. The one who wrote the background of this task should be immediately exterminated.

        • omagrawal1207 + 0 comments

          I did the same but missed head == NULL part Thanks

        • NSVR57 + 0 comments

          we are not updating head with lastnode but we do only temp. how head is updating automatically?

      • [deleted] + 0 comments

        new_node = new SinglyLinkedListNode(data);

        try this in 2nd line

      • sanket_sonje99 + 0 comments
        [deleted]

      • sanket_sonje99 + 0 comments

        SinglyLinkedListNode *new_node = new SinglyLinkedListNode(data); new_node->data = data; new_node->next = NULL;

        SinglyLinkedListNode *ptr;

if(head == NULL)
{
    head = new_node;
    return head;
}
else
{
    ptr = head;
    while(ptr->next != NULL)
    {
        ptr = ptr->next;
    }
    ptr->next = new_node;
    new_node->next = NULL;

    return head;    
}

    • akkuarora07 + 0 comments

      how can i remove this error?

      solution.cc:47:1: error: ‘Node’ does not name a type; did you mean ‘modf’?

      please help.

    • ashish21ghosh + 0 comments

      I don't think you need to check if head->next==NULL, rather in the else block you can add

      head->next = Insert(head->next,data);

    • vidushic0 + 0 comments

      you are genius