stack.cpp

数据结构里面对于表达式的弹栈运算,将表达式转化成后缀表达式

#include<iostream.h>

#include"Stack.h"

Stack::Stack(int MaxStackSize)
	:MaxSize(MaxStackSize),top(-1)
{
	stack = new int [MaxSize];
}

bool Stack::IsEmpty()
{
	return top==-1;

}

bool Stack::IsFull()
{
	return top==MaxSize-1;
}

void Stack::MakeEmpty()
{
	top = -1;
}

void Stack::Add(int x)
{
	if(IsFull())
		cout<<"Space is not enough!"<<endl;
	else
		stack[++top] = x;
}

int Stack::Delete()
{
	if(IsEmpty())
		cout<<"No element in Stack!"<<endl;
	else
		return stack[top--];
}