53 lines
1.3 KiB
C
53 lines
1.3 KiB
C
![]() |
//
|
||
|
// Created by s444440 on 10/30/19.
|
||
|
//
|
||
|
|
||
|
#ifndef PROJEKTDSIK_LINKEDLIST_H
|
||
|
#define PROJEKTDSIK_LINKEDLIST_H
|
||
|
#include<stdio.h>
|
||
|
#include<stdlib.h>
|
||
|
struct Node
|
||
|
{
|
||
|
// Any data type can be stored in this node
|
||
|
void *data;
|
||
|
|
||
|
struct Node *next;
|
||
|
} typedef ListElement;
|
||
|
|
||
|
/* Function to add a node at the beginning of Linked List.
|
||
|
This function expects a pointer to the data to be added
|
||
|
and size of the data type */
|
||
|
void push(struct Node** head_ref, void *new_data, size_t data_size)
|
||
|
{
|
||
|
// Allocate memory for node
|
||
|
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;
|
||
|
}
|
||
|
|
||
|
/* Function to print nodes in a given linked list. fpitr is used
|
||
|
to access the function to be used for printing current node data.
|
||
|
Note that different data types need different specifier in printf() */
|
||
|
void printList(struct Node *node, void (*fptr)(void *))
|
||
|
{
|
||
|
while (node != NULL)
|
||
|
{
|
||
|
(*fptr)(node->data);
|
||
|
node = node->next;
|
||
|
}
|
||
|
}
|
||
|
|
||
|
|
||
|
|
||
|
#endif //PROJEKTDSIK_LINKEDLIST_H
|