DEFINATION: => STACK:- is a collection of data item in which insertion and deletion takes from the TOP of stack.*TOP is a pointer variable that hold the address of the item of stack.
*In stack order of insertion is reverse of order of deletion of items.
*It is based on LIFO ( last in first out) operation.
*eg-suppose we insert 5 elements in stack i.e a b c d e etc. So order of insertion a b c d e and order of deletion of data item is e d c b a etc.
*STACK is a LINEAR DATA STRUCTURE.
*it deals with manipulation and retrival of items from internal memory.
REPRESENTATION OF STACK:-
TWO METHODS
1) STATIC IMPLEMENTATION
2) LINKED IMPLEMENTATION
Kindly Share The Love »»
|
|
|
Tweet | Save on Delicious |
No comments:
Post a Comment