C++使用类实现栈的push和pop

#include<iostream> 

#define MAX 15

//enum result_val{EMPTY_OK = 1000,EMPTY_NO = 1001,FULL_OK = 1002,FULL_NO = 1003};

using namespace std;

class Stack
{
	public:
		void initstack();
        //int full();
        bool full();
        void push(int num);
        //int empty();
        bool empty();
        void pop();
        void delete_data();
		
	private:
		int * data;
		int top;
        int num;     
        int size = 15;
};


void Stack::initstack()
{
    data = new int[size];
    top = -1;
}

/*int Stack::full()
{
    if(top == MAX -1 )
    {
        return FULL_OK;
    }
    else
    {
        return FULL_NO;
    }
}*/
bool Stack::full()
{
    return top == 15;
}

void Stack::push(int num)
{
    if(true == full())
    {
        printf("the stack is full\n");
    }
    else
    {
       // cout<<num<<endl;
        this->num = num;
        data[++top] = num;
        //cout