stack.c

/**
 * @file    stack.c
 * @brief   Stack functions for n-puzzle solver program
 * @author  Mitchell Clay
 * @date    4/18/2020
**/

#include <stdbool.h>
#include "node.h"
#include "stack.h"
#include <stdio.h>
#include <stdlib.h>

void push(struct Node** node, struct Element** stack, bool debug) {
    struct Element* element = (struct Element*)malloc(sizeof(struct Element));
    element -> node = *node;
    element -> next = *stack;
    (*stack) = element;
}

struct Node* pop(struct Element** stack, bool debug) {
    if (*stack != NULL) {
        struct Node* node = (*stack) -> node;
        struct Element* tempPtr = *stack;
        *stack = (*stack) -> next;
        free(tempPtr);
        return node;
    }
}

void top(struct Element* stack, unsigned puzzle_size, bool debug) {
    if (stack != NULL) {
        struct Node* node = stack -> node;
        printf("Top element is: \n");
        printNodeInfo(node, puzzle_size);
    }
    else {
        printf("The stack is empty\n");
    }
}

bool StackEmpty (struct Element* stack) {
    bool empty = true;
    if (stack != NULL) {
        empty = false;
    }
    return empty;
}