dsa_hkc_docs/linkedlist_8h_source.html

#ifndef LINKEDLIST_H

#define LINKEDLIST_H


#include <stdio.h>


typedef struct node {

    int value;

    struct node *next;

} node_t;


void printlist(node_t *head);


node_t *create_new_node(int value);


node_t *insert_at_head(node_t **head, node_t *node_to_insert);


node_t *find_node(node_t *head, int value);


void insert_after_node(node_t *node_to_insert_after, node_t *newnode);


void free_list(node_t *head);


#endif // LINKEDLIST_H

printlist
void printlist(node_t *head)
Prints all the values in the linked list.
Definition linkedlist.c:14

insert_after_node
void insert_after_node(node_t *node_to_insert_after, node_t *newnode)
Inserts a new node after a given node.
Definition linkedlist.c:48

find_node
node_t * find_node(node_t *head, int value)
Finds the first node with a given value.
Definition linkedlist.c:38

create_new_node
node_t * create_new_node(int value)
Creates a new node with a given integer value.
Definition linkedlist.c:24

free_list
void free_list(node_t *head)
Frees all nodes in the linked list.
Definition linkedlist.c:5

insert_at_head
node_t * insert_at_head(node_t **head, node_t *node_to_insert)
Inserts a node at the head of the list.
Definition linkedlist.c:32

node_t
struct node node_t
A node in the singly linked list.

node
A node in the singly linked list.
Definition linkedlist.h:22

node::next
struct node * next
Pointer to the next node in the list.
Definition linkedlist.h:24

node::value
int value
The integer value stored in the node.
Definition linkedlist.h:23