Advertisement
Guest User

Untitled

a guest
Mar 20th, 2018
55
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.33 KB | None | 0 0
  1. void AddBefore (node_t *head, int beforethis, int data)
  2. {
  3. node_t *p = malloc(sizeof(node_t));
  4. node_t *q,*temp;
  5. p->val = data;
  6. temp = head;
  7. int i;
  8. if (beforethis == 1) {
  9. p->next = head;
  10. head = p;
  11. }
  12. for(i=1; i<beforethis-1; i++)
  13. temp = temp->next;
  14. q = temp->next;
  15. temp->next = p;
  16. p->next = q;
  17. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement