1#ifndef DOUBLY_LINKED_LIST_H
2#define DOUBLY_LINKED_LIST_H
Node * appendNodeToEndOfList(List *list, Node *node, bool check_for_existing_node)
Append a node to the end of a list.
Node * createNode(void)
Allocates memory for a new node and initalizes it.
Node * removeNodeWithValue(List *list, int data)
Remove a node from a list with a specific value of playing_card_.
bool removeNodeFromList(List *list, Node *node)
Removes a node from the list.
void printList(List *list)
Print the whole List without trailing .
bool freeNode(Node *node)
Frees the memory of a node.
bool freeList(List *list)
Frees the memory of a list and all nodes in it.
List * createList(void)
Allocates memory for a new list and initalizes it.
List * appendListToEndOfList(List *list, List *list_to_append)
Node * remove_first(List *list)
Remove first node in list.
bool checkElementInList(Node *current_node, Node *node_to_check)
Checks if the adress of a node is already in a list (rekursive)