stackcopy.cpp

包括图、二叉树、链表

#include"stackcopy.h"
stackcopy::stackcopy()
{
	countcopy=0;
}
bool stackcopy::empty()
{
	bool outcome=true;
	if(countcopy==0)
		outcome=false;
	return outcome;
}

bool stackcopy::full()
{
	bool outcome=true;
	if(countcopy<stack_max)
		outcome=false;
	return outcome;
}
int stackcopy::size()
{
	return countcopy;
}
stack_entry stackcopy::top()
{
		if(countcopy==0)
			return 0;
		return entry[countcopy-1];
}
Eorro_codecopy stackcopy::push(stack_entry&item)
{

	Eorro_codecopy outcome=succese;
	if(countcopy==stack_max)
		outcome=overflow;
	else
		entry[countcopy++]=item;
	return outcome;
}
Eorro_codecopy stackcopy::pop()
{
	Eorro_codecopy outcome=succese;
	if(countcopy==0)
		outcome=underflow;
	else
		countcopy--;
	return outcome;
}