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

  • pratik9044536615 + 2 comments
    Node *temp = new Node();
temp->data=data;
temp->next=NULL;

if(head==NULL)
{
    head=temp;
}
else
{
    Node *current=head;
while(current->next!=NULL)
    {
        current=current->next;
    }
current->next=temp;
 }

return head;
    • kris21592 + 0 comments

      Hey,

      If we go in the else part, we should return current instead of head right?

      How does returning head give us the correct solution? Can you please explain?

    • samikshya_chand1 + 1 comment

      my program is the same as yours except the first part of the code where mine says

      Node *temp;    //did not use Node*temp=new Node
temp->data=data;
temp->next=NULL;

      This is causing error in my code.. Can you please explain?

      • gurudashimself + 0 comments

        This is becase when you used Node *temp, you just made a pointer of type Node, No memory was allocated as in the pratik9044536615's code where he uses 

        new Node();

        So, I would suggest allocating memory either using new Node() or go all C style and use 

        Node *temp = (Node  *)malloc(sizeof(Node));