Notes

// C program for generic linked list
#include<stdio.h>
#include<stdlib.h>


struct node
{

void *data;

struct node *next;
};


void push(struct node** head_ref, void *new_data, size_t data_size)
{

struct node* new_node = (struct node*)malloc(sizeof(struct node));

new_node->data = malloc(data_size);
new_node->next = (*head_ref);

// Copy contents of new_data to newly allocated memory.
// Assumption: char takes 1 byte.
int i;
for (i=0; i<data_size; i++)
*(char *)(new_node->data + i) = *(char *)(new_data + i);

// Change head pointer as new node is added at the beginning
(*head_ref) = new_node;
}


void printList(struct node *node, void (*fptr)(void *))
{
while (node != NULL)
{
(*fptr)(node->data);
node = node->next;
}
}

// Function to print an integer
void printInt(void *n)
{
printf(" %d", *(int *)n);
}



int main()
{
struct node *start = NULL;

// Create and print an int linked list
unsigned int_size = sizeof(int);
int arr[] = {10, 20, 30,}, i;
for (i=2; i>=0; i--)
push(&start, &arr[i], int_size);
printf("Created integer linked list is n");
printList(start, printInt);

// Create and print a float linked list
unsigned float_size = sizeof(float);
start = NULL;
float arr2[] = {10.1, 20.2, 30.3, 40.4, 50.5};
for (i=4; i>=0; i--)
push(&start, &arr2[i], float_size);
printf(" NULL");

system ("pause");
return 0;
}