A stack is a last in- first out (LIFO) abstract data type and linear data structure.
It is small data structure having only two fundamental operation only.
--------------------------------------------------------------------------------------------------------------------------------------
Those fundamental operations are:-
--------------------------------------------------------------------------------------------------------------------------------------
a.push (insert an element in top of stack)
b.pop (remove an element from top of stack)
--------------------------------------------------------------------------------------------------------------------------------------
And some other extra functions understanding
--------------------------------------------------------------------------------------------------------------------------------------
c.printing (printing of all element present in stack)
d.pick (getting the element at top of stack but do not remove)
It follow some rules:-
rule1:
Data element can be inserted at the top of the stack.
rule2:
Data element can be deleted/remove from the top of the stack.
LINKS
------------------------------------------------------------------------------------------------------------------------------------
1.WIKI for STACK
2.STACK IMPLEMENTED USING ARRAY IN C
3.STACK IMPLEMENTED USING LINKED LIST IN C
4.WIKI BOOK FOR STACK
5. ADT FOR STACK IMPLEMENTATION
It is small data structure having only two fundamental operation only.
--------------------------------------------------------------------------------------------------------------------------------------
Those fundamental operations are:-
--------------------------------------------------------------------------------------------------------------------------------------
a.push (insert an element in top of stack)
b.pop (remove an element from top of stack)
--------------------------------------------------------------------------------------------------------------------------------------
And some other extra functions understanding
--------------------------------------------------------------------------------------------------------------------------------------
c.printing (printing of all element present in stack)
d.pick (getting the element at top of stack but do not remove)
It follow some rules:-
rule1:
Data element can be inserted at the top of the stack.
rule2:
Data element can be deleted/remove from the top of the stack.
LINKS
------------------------------------------------------------------------------------------------------------------------------------
1.WIKI for STACK
2.STACK IMPLEMENTED USING ARRAY IN C
3.STACK IMPLEMENTED USING LINKED LIST IN C
4.WIKI BOOK FOR STACK
5. ADT FOR STACK IMPLEMENTATION
No comments:
Post a Comment