Home Questions Search Forum Contact Guest Book Polls! Got a Question?
PREV Linked Lists NEXT   (16 / 301)     Write a C program to insert nodes into a linked list in a sorted fashion The solution is to iterate down the list looking for the correct place to insert the new node. That could be the end of the list, or a point just before a node which is larger than the new node. Note that we assume the memory for the new node has already been allocated and a pointer to that memory is being passed to this function. // Special case code for the head end void linkedListInsertSorted(struct node** headReference, struct node* newNode)  {   // Special case for the head end   if (*headReference == NULL || (*headReference)->data >= newNode->data)    {      newNode->next = *headReference;      *headReference = newNode;   }   else    {      // Locate the node before which the insertion is to happen!      struct node* current = *headReference;      while (current->next!=NULL && current->next->data < newNode->data)       {         current = current->next;      }      newNode->next = current->next;      current->next = newNode;    } } PREV COMMENTS                                  INDEX                                  PRINT NEXT Last updated: November 3, 2005 www.cracktheinterview.com - Your destination for the most common IT interview questions, answers, frequently asked interview questions (FAQ), C Programs, C Datastructures for technical interviews conducted by the top IT companies around the world!