diff options
| author | Blake Romero <blake@blkrom.com> | 2024-09-02 01:20:18 +0100 |
|---|---|---|
| committer | Blake Romero <blake@blkrom.com> | 2024-10-30 10:13:26 +0000 |
| commit | 6469b2c887716a5c6a0e191c5ffeb7972f7f7b34 (patch) | |
| tree | 9006291004faec2ce91094754fc7992a129caebf /linkedlist/ll.h | |
| parent | 3773eb12e3a613cbde4890be0c1d2a9b548abf63 (diff) | |
Add initial linked list implementation
Diffstat (limited to 'linkedlist/ll.h')
| -rw-r--r-- | linkedlist/ll.h | 54 |
1 files changed, 54 insertions, 0 deletions
diff --git a/linkedlist/ll.h b/linkedlist/ll.h new file mode 100644 index 0000000..0e15c43 --- /dev/null +++ b/linkedlist/ll.h @@ -0,0 +1,54 @@ +#ifndef LL +#define LL + +#define NEW_NODE llnode(); + +#include <stdio.h> +#include <stdlib.h> + +// Node +typedef struct Node { + int value; + struct Node* next; +} Node; + +// Create & initialise a new node +Node* llnode(); + +// Print linked list values +// O() +void llprint(Node* head); +void llvprint(Node* head); + +// Return number of nodes in list +// O(n) +int llcount(Node* head); + +// Append value to the end of the list +// O(n) +void llappend(Node* head, int value); + +// Prepend a value to the list +// O(1) +void llpush(Node** head, int value); + +// Insert a value to the list at index +// O(n) +void llinsert(Node** head, int value, int index); + +// Free nodes from memory +void llfree(Node* head); + +// Pop (remove) first node +// O(1) +int llpop(Node** head); + +// Remove last node +// O(n) +int llrmlast(Node** head); + +// Remove node at index +// O(n) +int llrm(Node** head, int index); + +#endif //LL |
