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.
Loading...
  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

  • shubhvratj + 3 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 + 1 comment

      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