Created: 2022-06-29
Tags: #permanent
node *head is the EXISTING linked list
int len means how many nodes you want to add
void add_nodes_iteratively(node *head, int len)
{
// Variables used throughout the function
int num;
int counter = 1;
node *current = head;
// Counts how many nodes there are
while (current->next != NULL) {
current = current->next;
counter++;
}
for (int i = 0 + counter; i < len + counter; i++)
{
printf("Input data for node %i: ", i);
scanf("%i", &num);
// Iterate to last node
while (current->next != NULL) {
current = current->next;
}
/* now we can add values to end*/
current->next = (node *) malloc(sizeof(node));
if (current->next == NULL) { return; }
current->next->val = num;
current->next->next = NULL;
}
}