Advertisement
stsharin

Untitled

Feb 25th, 2018
101
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.92 KB | None | 0 0
  1. #include<stdio.h>
  2. #include<stdlib.h>
  3.  
  4. typedef struct Node
  5. {
  6. int data;
  7. struct Node *next;
  8.  
  9. }node;
  10.  
  11. node* head=NULL;
  12.  
  13. void insert_end(int data)
  14. {
  15. node *newnode;
  16. newnode=(node*)malloc(sizeof(node));
  17. newnode->data=data;
  18. newnode->next=NULL;
  19. if(head==NULL)
  20. {
  21. head=newnode;
  22. }
  23. else
  24. {
  25. node* current=head;
  26. while(current->next!=NULL)
  27. {
  28. current=current->next; //in 3rd time current->next = newnode
  29. }
  30. current->next=newnode;
  31. }
  32. }
  33.  
  34. void printData()
  35. {
  36. node* current=head;
  37. printf("New List is: ");
  38. while(current!=NULL)
  39. {
  40. printf("%d ",current->data);
  41. current=current->next;
  42. }
  43. printf("\n");
  44. }
  45.  
  46. int main()
  47. {
  48. int i,n;
  49. int a[100];
  50.  
  51. scanf("%d",&n);
  52.  
  53. for(i=0;i<n;i++){
  54. scanf("%d",&a[i]);
  55. insert_end(a[i]);
  56. }
  57. printData();
  58. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement