In computer science, a stack is a last in, first out (LIFO) abstract data type and data structure.A stack is a list of elements may be inserted or deleted only at one end called top of the stack .This means,in particular that elements are removed from a stack in the reverse order of that in which they were inserted into the stack A stack can have any abstract data type as an element, but is characterized by only two fundamental operations:
PUSH:"PUSH" is the term used to insert an element into a stack.
POP:"POP" is the term used to delete an element from a stack.
Overflow condition in stack:Stack is already fully filled ,you can't enter (push) new element in stack.
Underflow condition in stack:Stack is empty i.e. there is no element in stack ,you can't delete(pop) any element from the stack.
Stack implementation using array and linked list:
Download Link : http://www.fileserve.com/file/mUXxmeu/Stack.rar
PUSH:"PUSH" is the term used to insert an element into a stack.
POP:"POP" is the term used to delete an element from a stack.
Underflow condition in stack:Stack is empty i.e. there is no element in stack ,you can't delete(pop) any element from the stack.
Stack implementation using array and linked list:
Download Link : http://www.fileserve.com/file/mUXxmeu/Stack.rar
No comments:
Post a Comment