| Share this post! | Vote this! |
|
A stack is a restricted data structure, because only a small
number of operations are performed on it. Elements are removed from the
stack in the reverse order to the order of their addition. For more
information on stack, go through this article.
In this article here, we’ll discuss real world applications of stack. First we’ll see infix to postfix conversion. What is actually done is in infix to postfix, an expression is scanned from user in infix form; it is converted into prefix or postfix form and then evaluated without considering the parenthesis and priority of the operators. more....
In this article here, we’ll discuss real world applications of stack. First we’ll see infix to postfix conversion. What is actually done is in infix to postfix, an expression is scanned from user in infix form; it is converted into prefix or postfix form and then evaluated without considering the parenthesis and priority of the operators. more....
0 comments:
Post a Comment