Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<stdio.h>
- #include<stdlib.h>
- typedef struct Node
- {
- int data;
- struct Node *next;
- }node;
- node* head=NULL;
- void insert_end(int data)
- {
- node *newnode;
- newnode=(node*)malloc(sizeof(node));
- newnode->data=data;
- newnode->next=NULL;
- if(head==NULL)
- {
- head=newnode;
- }
- else
- {
- node* current=head;
- while(current->next!=NULL)
- {
- current=current->next; //in 3rd time current->next = newnode
- }
- current->next=newnode;
- }
- }
- void printData()
- {
- node* current=head;
- printf("New List is: ");
- while(current!=NULL)
- {
- printf("%d ",current->data);
- current=current->next;
- }
- printf("\n");
- }
- int main()
- {
- int i,n;
- int a[100];
- scanf("%d",&n);
- for(i=0;i<n;i++){
- scanf("%d",&a[i]);
- insert_end(a[i]);
- }
- printData();
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement