You are currently browsing the tag archive for the ‘Stack’ tag.
Some applications of stacks are:
1) Recursion
2) Towers of Hanoi
3)Infix to postfix evaluation
4)Postfix evaluation
so on…..
This is program on Towers of Hanoi :
STACK :-This is also one type of data structure.It can be seen as restricted type of linear list in which addition or deletion can be done from only one end and that end is called as top of the stack, so this can also be called as LAST IN FIRST OUT(LIFO).
The addition of element is called push and deletion of element form list is called pop.
This is program on Stack using formula-based representation:
