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

  • kalpitshah0078 + 1 comment

    you have not covered the condition where the head is null. if you want to do this in this manner , your code should be somthing like this:

    Node* Insert(Node *head,int data) { if(head==NULL) { Node *newn=(Node *)malloc(sizeof(Node));

            newn->next=NULL;
        newn->data=data;
        head=newn;

    }
else{
     Node *newn2=(Node *)malloc(sizeof(Node));
    newn2=head;
    while(newn2->next!=NULL){
        newn2=newn2->next;
    }
    newn2->next=Insert(newn2->next , data);

}
return head;

    }

    • saikiranhs + 0 comments

      thanks! nice one! you can reduce complexity by removing while loop there, because anyway in recursion head moves as you pass newn2->next, so no need to check the condition whether it is pointing to the extreme