stack.cpp

王红梅编《数据结构》大多数的实验源码。内附详细的实验报告。

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

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

Point Stack::GetTop() const
{
	if (top == -1)
		throw "下溢";
	return data[top];
}

Point Stack::Pop()
{
	if (top == -1)
		throw "下溢";
	return data[top--];
}

void Stack::Push(Point x)
{
	if (top + 1 >= STACK_MAX_SIZE)
		throw "上溢";
	data[++top] = x;
}

bool Stack::Empty() const
{
	if (top == -1)
		return true;
	else
		return false;
}

void Stack::PrintRightPath() const
{
	int i = 0;
	while (i <= top)
	{
		cout << data[i].x << ',' << data[i].y << endl;
		i++;
	}
}