Advertisement
Guest User

Untitled

a guest
Aug 17th, 2019
86
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.39 KB | None | 0 0
  1. SinglyLinkedListNode *newNode = (SinglyLinkedListNode*)malloc(sizeof(SinglyLinkedListNode));
  2. newNode->data = data;
  3.  
  4. if (head == NULL) {
  5. return newNode;
  6. }
  7.  
  8. if (position == 0) {
  9. newNode->next = head;
  10. return newNode;
  11. }
  12.  
  13. while((currentNode->next)!=position)
  14. {
  15. currentNode=currentNode->next;
  16. }
  17.  
  18. newNode->next = currentNode->next;
  19. currentNode->next = newNode;
  20.  
  21. return head;
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement