Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<stdio.h>
- #include<stdlib.h>
- struct Node
- {
- int data;
- struct Node *next;
- };
- void insert(struct Node *, int);
- int main(void)
- {
- struct Node *head = NULL, *current;
- int n, i, x, data;
- scanf("%d", &n);
- for(i = 0; i < n; i++)
- {
- scanf("%d", &data);
- insert(head, data);
- }
- current = head;
- while(current != NULL)
- {
- printf("%d ", current->data);
- current = current->next;
- }
- }
- void insert(struct Node *head, int data)
- {
- struct Node *newnode, *current = head;
- newnode = (struct Node *)malloc(sizeof(struct Node));
- newnode->data = data;
- newnode->next = NULL;
- if(head == NULL)
- {
- head = newnode;
- }
- else
- {
- while(current->next != NULL)
- {
- current = current->next;
- }
- current->next = newnode;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement