From 2e2b082928eb1ad261ee1d35baa7cc580492e34a Mon Sep 17 00:00:00 2001 From: Alex Reece Date: Thu, 5 Nov 2026 15:34:08 +0100 Subject: [PATCH 1/2] push stack half started --- Startcode/stack.c | 6 ++++++ Startcode/stack.h | 6 ++++++ 2 files changed, 12 insertions(+) diff --git a/Startcode/stack.c b/Startcode/stack.c index e3a90d4..9c3607a 100644 --- a/Startcode/stack.c +++ b/Startcode/stack.c @@ -10,7 +10,13 @@ // Pushes data as pointer onto the stack. StackNode *push(StackNode *stack, void *data) { + StackNode *newItem = (StackNode*)calloc(1, sizeof(StackNode)); + if (newItem == NULL) return NULL; + stack->left = newItem; + newItem->right = stack; + newItem->data = data; + return newItem; } // Deletes the top element of the stack (latest added element) and releases its memory. (Pointer to data has to be diff --git a/Startcode/stack.h b/Startcode/stack.h index f7d542d..66033f3 100644 --- a/Startcode/stack.h +++ b/Startcode/stack.h @@ -8,6 +8,12 @@ The latest element is taken from the stack. */ #include //TODO: passenden Datentyp als struct anlegen +typedef struct stacknode { + struct stacknode* left; + struct stacknode* right; + // size_t size; + void *data; +} StackNode; // Pushes data as pointer onto the stack. StackNode *push(StackNode *stack, void *data); From 975498524bb2ec3bd0a112450fa0bed4050cbefc Mon Sep 17 00:00:00 2001 From: Alex Reece Date: Thu, 12 Nov 2026 00:11:38 +0100 Subject: [PATCH 2/2] stack should work --- Startcode/stack.c | 17 +++++++++++++++-- 1 file changed, 15 insertions(+), 2 deletions(-) diff --git a/Startcode/stack.c b/Startcode/stack.c index 9c3607a..6477ba4 100644 --- a/Startcode/stack.c +++ b/Startcode/stack.c @@ -14,6 +14,7 @@ StackNode *push(StackNode *stack, void *data) if (newItem == NULL) return NULL; stack->left = newItem; newItem->right = stack; + newItem->left = NULL; newItem->data = data; return newItem; @@ -23,17 +24,29 @@ StackNode *push(StackNode *stack, void *data) // freed by caller.) StackNode *pop(StackNode *stack) { + // grab next item, detatch it (becomes new head) + StackNode *newHead = stack->right; + newHead->left = NULL; + // free the old head's struct + free(stack); + + // give back the new head + return newHead; } // Returns the data of the top element. void *top(StackNode *stack) { - + return stack->data; + } // Clears stack and releases all memory. void clearStack(StackNode *stack) { - + do + { + stack = pop(stack); + } while (stack != NULL); } \ No newline at end of file