#include <stdlib.h>
#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 *new=malloc(sizeof(StackNode));
    if(new ==NULL){
        return new;
    }
    new->data = data;
    new->dannach = stack;
    return new;
}

// 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)
{
    StackNode *new=malloc(sizeof(StackNode));
    if(new ==NULL){
        return new;
    }
    new = stack->dannach;

    stack->dannach = NULL;
    free(stack->data);
    free(stack);
    return new;
}

// Returns the data of the top element.
void *top(StackNode *stack)
{
    return stack->data;
}

// Clears stack and releases all memory.
void clearStack(StackNode *stack)
{
    if(stack == NULL){
        return;
    }
    clearStack(stack->dannach);
    free(stack->dannach);
    free(stack->data);
    free(stack);
}