Stack.cpp

Go to the documentation of this file.

 
#include "Stack.h"
#include <iostream>

Stack::~Stack() {
    // Remove all nodes from top to bottom.
    while (!isEmpty()) {
        pop();
    }
}

void Stack::push(Node* n) {
    StackNode* s = new StackNode(n);
    s->next = top;
    top = s;
}

Node* Stack::pop() {
    if (!top) return nullptr;
    StackNode* temp = top;
    Node* result = temp->data;
    top = top->next;
    delete temp;
    return result;
}

bool Stack::isEmpty() const {
    return top == nullptr;
}