generated from freudenreichan/info2Praktikum-DobleSpiel
Stack initial code done
This commit is contained in:
commit
d74cfc2ab7
2 files changed
+27
-2
No files matched your search
+21
-2
@@ -10,24 +10,43 @@
|
||||
// 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->left = NULL;
|
||||
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
|
||||
// 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);
|
||||
}
|
||||
@@ -8,6 +8,12 @@ The latest element is taken from the stack. */
|
||||
#include <stdlib.h>
|
||||
|
||||
//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);
|
||||
|
||||
Reference in new issue
Block a user