Advertisement
Guest User

Untitled

a guest
Jul 27th, 2017
50
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.84 KB | None | 0 0
  1. #include<stdio.h>
  2. #include<stdlib.h>
  3. struct Node
  4. {
  5. int data;
  6. struct Node *next;
  7. };
  8. void insert(struct Node *, int);
  9. int main(void)
  10. {
  11. struct Node *head = NULL, *current;
  12. int n, i, x, data;
  13. scanf("%d", &n);
  14. for(i = 0; i < n; i++)
  15. {
  16. scanf("%d", &data);
  17. insert(head, data);
  18. }
  19. current = head;
  20. while(current != NULL)
  21. {
  22. printf("%d ", current->data);
  23. current = current->next;
  24. }
  25. }
  26. void insert(struct Node *head, int data)
  27. {
  28. struct Node *newnode, *current = head;
  29. newnode = (struct Node *)malloc(sizeof(struct Node));
  30. newnode->data = data;
  31. newnode->next = NULL;
  32. if(head == NULL)
  33. {
  34. head = newnode;
  35. }
  36. else
  37. {
  38. while(current->next != NULL)
  39. {
  40. current = current->next;
  41. }
  42. current->next = newnode;
  43. }
  44. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement