CIS 610-251: Data Structures and Algorithms
Due: Sep 30, 1999.
Assignment #2 Question #3

pushandtest:
This routine tests if stack is overflowing or not. 
If stack is not full, data element is pushed otherwise error is returned.

void Stack::push(int item)
{ 
	if (sp<spMax) data[sp]=item; 
	else cout << " Overflow";
	
}

Where,
sp= Stack Pointer containing current index
spMax=Max Value stack pointer can get.