Question

insertion of node at end in singly linked list

Answer 1

Insertion of node at end

Algorithm to insert node at the end

Step 1: IF PTR = NULL Write OVERFLOW     Go to Step 1    [END OF IF] Step 2: SET NEW_NODE = PTR Step 3: SET PTR = PTR - > NEXT Step 4: SET NEW_NODE - > DATA = VAL Step 5: SET NEW_NODE - > NEXT = NULL Step 6: SET PTR = HEAD Step 7: Repeat Step 8 while PTR - > NEXT != NULL Step 8: SET PTR = PTR - > NEXT [END OF LOOP] Step 9: SET PTR - > NEXT = NEW_NODE Step 10: EXIT

 Example

 

Program to insert a node at the end

#include <stdio.h> #include<conio.h> #include<stdlib.h>   void end(int);   struct node   {       int data;       struct node *next;   };   struct node *head;   void end(int item)       {           struct node *ptr = (struct node*)malloc(sizeof(struct node));              struct node *temp;           if(ptr == NULL)           {               printf("\nOVERFLOW");              }           else           {               ptr->data = item;               if(head == NULL)               {                   ptr -> next = NULL;                   head = ptr;                   printf("\nNode inserted");               }               else               {                   temp = head;                   while (temp -> next != NULL)                   {                       temp = temp -> next;                   }                   temp->next = ptr;                   ptr->next = NULL;                   printf("\ngiven node is inserted");                           }      }  }     void display()   {       struct node *ptr;       ptr = head;        if(ptr == NULL)       {           printf("Nothing to print");       }       else       {           printf("\ninsertion of node at end\n");            while (ptr!=NULL)           {               printf("\n%d",ptr->data);               ptr = ptr -> next;         }    }  }  void main ()   {       int item;           printf("\nEnter the item which you want to insert : \n");           scanf("%d",&item);           end(item);         display();   }

Output

---

For more Manipal University Jaipur B.Tech CSE-III Sem Data Structure Lab Experiments Click here

---

Answer 2

27/04/2020

Algorithm to insert node at the end of a Singly Linked List
Begin:
    createSinglyLinkedList (head)
    alloc (newNode)
    If (newNode == NULL) then
        write ('Unable to allocate memory')
    End if
    Else then
        read (data)
        newNode.data ← data
        newNode.next ← NULL
        temp ← head
        While (temp.next != NULL) do
            temp ← temp.next
        End while
        temp.next ← newNode
    End else
End