не удается использовать функцию print()

#include <iostream>
#include <string>
 
#define N 6
 
using namespace std;
 
struct Book
{
    string name = "NULL";
    short pages = 0;
    double price = 0;
};
 
struct Stack
{
    Book arr[N];
    int stackSize = 0;
 
    int size(){
        Stack pStack;
        return pStack.stackSize;
    }
    bool empty() {
        Stack pStack;
        return pStack.size() == 0 ? 1 : 0;
    }
 
    void push(Book pBook)
    {
        Stack pushStack;
        if (size() < N)
        {
            pushStack.arr[pushStack.stackSize] = pBook;
            pushStack.stackSize++;
        }
        else cout << "Overflow" << endl;
    }
 
 
    void pop()
    {
        Stack pStack;
        pStack.stackSize--;
    }
 
 
    Book top()
    {
        Stack pStack;
        if (pStack.empty() == 0)
        {
            pStack.stackSize--;
            return pStack.arr[(pStack).stackSize];
        }
        else
        {
            cout << "Underflow" << endl;
            return { "NULL", 0, 0 };
        }
    }
    void print()
    {
        Stack printStack;
        while(printStack.empty() == 0)
        {
            Book book = printStack.top();
            cout << book.name << "  "<< book.pages << "  " << book.price << endl;
 
        }
 
    }
};
 
int main()
{
    Stack stackOfBook;
 
    Book book1 = {"book1",134, 122};
    Book book2 = {"book2",855, 122};
    Book book3 = {"book3",553, 122};
    Book book4 = {"book4",134, 122};
    Book book5 = {"book5",1205, 122};
    Book book6 = {"book6",1789, 122};
    Book book7 = {"book7",1226, 122};
    Book book8 = {"book8",142, 122};
    Book book9 = {"book9",146, 122};
 
    stackOfBook.push({"book1",134, 122});
 
    stackOfBook.print();
 
    return 0;
}

#include <iostream>
#include <string>
 
//#define N 6
 
using namespace std;
 
struct Book
{
    string name;
    int pages;
    double price;
    Book():pages(0),price(0)
    {
        name="Null";
    }
    Book(string s,int p,double q):pages(p),price(p)
    {
        name=s;
    }
};
 
class Stack
{
    int N;
    Book* arr;
    int stackSize;
public: 
    Stack(int n=10):N(n),stackSize(0)
    {
        arr=new Book[n];
    }
    ~Stack(){delete[] arr;}
    int size(){
        return stackSize;
    }
    bool empty() {
        return stackSize == 0;
    }
 
    void push(Book pBook)
    {
        if (stackSize < N)
        {
            arr[stackSize] = pBook;
            stackSize++;
        }
        else 
            cout << "Overflow" << endl;
    }
 
 
    void pop()
    {
        if(stackSize>0)
            stackSize--;
    }
 
 
    Book top()
    {
        if (stackSize > 0)
        {
            stackSize--;
            return arr[stackSize];
        }
        else
        {
            cout << "Underflow" << endl;
            Book t;
            return t;
        }
    }
    void print()
    {
        while(stackSize > 0)
        {
            Book book = top();
            cout << book.name << "  "<< book.pages << "  " << book.price << endl;
        }
 
    }
};
 
int main()
{
    Stack stackOfBook(20);
 
    Book book1("book1",134, 122);
    stackOfBook.push(book1);
    Book book2("book2",855, 122);
    stackOfBook.push(book2);
    Book book3("book3",553, 122);
    stackOfBook.push(book3);
    Book book4("book4",134, 122);
    stackOfBook.push(book4);
    Book book5("book5",1205, 122);
    stackOfBook.push(book5);
    Book book6("book6",1789, 122);
    stackOfBook.push(book6);
    Book book7("book7",1226, 122);
    stackOfBook.push(book7);
    Book book8("book8",142, 122);
    stackOfBook.push(book8);
    Book book9("book9",146, 122);
    stackOfBook.push(book9);
    stackOfBook.print();
    cin.get();
    return 0;
}