kachelto100370/info2Praktikum-DobleSpiel
1
0
Fork 0
forked from freudenreichan/info2Praktikum-DobleSpiel
Code Pull Requests Activity

arbeiten an stack.c

Browse Source
This commit is contained in:
Tobias Kachel 2025-12-05 11:13:27 +01:00
parent 624a7d8b41
commit 81de4b3d36
4 changed files with 9 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
bintree.c
View File

@ -1,4 +1,4 @@
t #include <string.h> #include <string.h>
#include "stack.h" #include "stack.h"
#include "bintree.h" #include "bintree.h"

6
stack.c
View File

@ -69,11 +69,15 @@ StackNode *pop(StackNode *stack) {
void *top(StackNode *stack) { return stack != NULL ? stack->data : NULL; } void *top(StackNode *stack) { return stack != NULL ? stack->data : NULL; }
// Clears stack and releases all memory. // Clears stack and releases all memory.
void *clearStack(StackNode *stack) { void clearStack(StackNode *stack) {
while (stack != NULL) { while (stack != NULL) {
StackNode *next = stack->next; StackNode *next = stack->next;
stack->data = NULL;
stack->prev = NULL;
stack->next = NULL;
free(stack); free(stack);
stack = next; stack = next;
} }

4
stack.h
View File

@ -14,7 +14,7 @@ typedef struct StackNode {
void *data; void *data;
struct StackNode *next; struct StackNode *next;
struct StackNode *prev; struct StackNode *prev;
} StackNode; } StackNode;
StackNode *createNode(void *data); StackNode *createNode(void *data);
@ -30,6 +30,6 @@ StackNode *pop(StackNode *stack);
void *top(StackNode *stack); void *top(StackNode *stack);
// Clears stack and releases all memory. // Clears stack and releases all memory.
StackNode *clearStack(StackNode *stack); void clearStack(StackNode *stack);
#endif #endif

2
test_stack.c
View File

@ -36,7 +36,7 @@ void test_clearStack(void) {
testStack = push(testStack, &testInts[i]); testStack = push(testStack, &testInts[i]);
} }
testStack = clearStack(testStack); clearStack(testStack);
TEST_ASSERT_NULL(testStack); TEST_ASSERT_NULL(testStack);
} }