stack should work

This commit is contained in:
reeceal105988 committed 2026-11-12 00:11:38 +01:00
1 parent 2e2b082928
commit 975498524b
1 file changed
+14 -1
+14 -1
View File
@@ -14,6 +14,7 @@ StackNode *push(StackNode *stack, void *data)
if (newItem == NULL) return NULL; if (newItem == NULL) return NULL;
stack->left = newItem; stack->left = newItem;
newItem->right = stack; newItem->right = stack;
newItem->left = NULL;
newItem->data = data; newItem->data = data;
return newItem; return newItem;
@@ -23,17 +24,29 @@ StackNode *push(StackNode *stack, void *data)
// freed by caller.) // freed by caller.)
StackNode *pop(StackNode *stack) 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. // Returns the data of the top element.
void *top(StackNode *stack) void *top(StackNode *stack)
{ {
return stack->data;
} }
// Clears stack and releases all memory. // Clears stack and releases all memory.
void clearStack(StackNode *stack) void clearStack(StackNode *stack)
{ {
do
{
stack = pop(stack);
} while (stack != NULL);
} }