![// C code on linked list
#include
#include
// structure for linked list
struct node
{
int value;
struct node *next;
};
// insert new value to linked list
void insert(struct node** head, int data)
{
// create node and insert value
struct node* newNode = (struct node*) malloc(sizeof(struct node));
newNode->value = data;
// update head
newNode->next = (*head);
(*head) = newNode;
}
// print linked list
void print(struct node *node)
{
printf("[ ");
while (node != NULL)
{
printf("%d", node->value);
node = node->next;
}
printf("] ");
}
int main()
{
// empty list
struct node* head = NULL;](https://image.slidesharecdn.com/ccodeonlinkedlistincludestdio-230412021039-0d2649fb/85/C-code-on-linked-list-include-stdio-h-include-stdlib-h-pdf-1-320.jpg)
![int array[5], i;
printf("Enter 5 values to add to list: ");
for (i = 0; i < 5; ++i)
{
scanf("%d",&array[i]);
}
// add elements to linked list
for (i = 0; i < 5; ++i)
{
insert(&head, array[i]);
}
printf(" Linked list: ");
print(head);
printf(" ");
int number;
printf("Add one more value to list: ");
scanf("%d",&number);
insert(&head, number);
printf(" Final Linked list: ");
print(head);
printf(" ");
return 0;
}
/*
output:
Enter 5 values to add to list: 5 4 7 9 1
Linked list: [ 1 9 7 4 5 ]
Add one more value to list: 6
Final Linked list: [ 6 1 9 7 4 5 ]
*/
Solution
// C code on linked list
#include
#include](https://image.slidesharecdn.com/ccodeonlinkedlistincludestdio-230412021039-0d2649fb/85/C-code-on-linked-list-include-stdio-h-include-stdlib-h-pdf-2-320.jpg)
![// structure for linked list
struct node
{
int value;
struct node *next;
};
// insert new value to linked list
void insert(struct node** head, int data)
{
// create node and insert value
struct node* newNode = (struct node*) malloc(sizeof(struct node));
newNode->value = data;
// update head
newNode->next = (*head);
(*head) = newNode;
}
// print linked list
void print(struct node *node)
{
printf("[ ");
while (node != NULL)
{
printf("%d", node->value);
node = node->next;
}
printf("] ");
}
int main()
{
// empty list
struct node* head = NULL;
int array[5], i;
printf("Enter 5 values to add to list: ");
for (i = 0; i < 5; ++i)
{](https://image.slidesharecdn.com/ccodeonlinkedlistincludestdio-230412021039-0d2649fb/85/C-code-on-linked-list-include-stdio-h-include-stdlib-h-pdf-3-320.jpg)
![scanf("%d",&array[i]);
}
// add elements to linked list
for (i = 0; i < 5; ++i)
{
insert(&head, array[i]);
}
printf(" Linked list: ");
print(head);
printf(" ");
int number;
printf("Add one more value to list: ");
scanf("%d",&number);
insert(&head, number);
printf(" Final Linked list: ");
print(head);
printf(" ");
return 0;
}
/*
output:
Enter 5 values to add to list: 5 4 7 9 1
Linked list: [ 1 9 7 4 5 ]
Add one more value to list: 6
Final Linked list: [ 6 1 9 7 4 5 ]
*/](https://image.slidesharecdn.com/ccodeonlinkedlistincludestdio-230412021039-0d2649fb/85/C-code-on-linked-list-include-stdio-h-include-stdlib-h-pdf-4-320.jpg)
C code on linked list #include stdio.h #include stdlib.h.pdf
- 1. // C code on linked list #include #include // structure for linked list struct node { int value; struct node *next; }; // insert new value to linked list void insert(struct node** head, int data) { // create node and insert value struct node* newNode = (struct node*) malloc(sizeof(struct node)); newNode->value = data; // update head newNode->next = (*head); (*head) = newNode; } // print linked list void print(struct node *node) { printf("[ "); while (node != NULL) { printf("%d", node->value); node = node->next; } printf("] "); } int main() { // empty list struct node* head = NULL;
- 2. int array[5], i; printf("Enter 5 values to add to list: "); for (i = 0; i < 5; ++i) { scanf("%d",&array[i]); } // add elements to linked list for (i = 0; i < 5; ++i) { insert(&head, array[i]); } printf(" Linked list: "); print(head); printf(" "); int number; printf("Add one more value to list: "); scanf("%d",&number); insert(&head, number); printf(" Final Linked list: "); print(head); printf(" "); return 0; } /* output: Enter 5 values to add to list: 5 4 7 9 1 Linked list: [ 1 9 7 4 5 ] Add one more value to list: 6 Final Linked list: [ 6 1 9 7 4 5 ] */ Solution // C code on linked list #include #include
- 3. // structure for linked list struct node { int value; struct node *next; }; // insert new value to linked list void insert(struct node** head, int data) { // create node and insert value struct node* newNode = (struct node*) malloc(sizeof(struct node)); newNode->value = data; // update head newNode->next = (*head); (*head) = newNode; } // print linked list void print(struct node *node) { printf("[ "); while (node != NULL) { printf("%d", node->value); node = node->next; } printf("] "); } int main() { // empty list struct node* head = NULL; int array[5], i; printf("Enter 5 values to add to list: "); for (i = 0; i < 5; ++i) {
- 4. scanf("%d",&array[i]); } // add elements to linked list for (i = 0; i < 5; ++i) { insert(&head, array[i]); } printf(" Linked list: "); print(head); printf(" "); int number; printf("Add one more value to list: "); scanf("%d",&number); insert(&head, number); printf(" Final Linked list: "); print(head); printf(" "); return 0; } /* output: Enter 5 values to add to list: 5 4 7 9 1 Linked list: [ 1 9 7 4 5 ] Add one more value to list: 6 Final Linked list: [ 6 1 9 7 4 5 ] */