#include #include "stack.h" //TODO: grundlegende Stackfunktionen implementieren: /* * `push`: legt ein Element oben auf den Stack, * `pop`: entfernt das oberste Element, * `top`: liefert das oberste Element zurück, * `clearStack`: gibt den gesamten Speicher frei. */ // 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 // freed by caller.) StackNode *pop(StackNode *stack) { } // Returns the data of the top element. void *top(StackNode *stack) { } // Clears stack and releases all memory. void clearStack(StackNode *stack) { }