Description: *** Expression evaluation will be converted to postfix infix expression expression. Assume that the input of the algorithm expression of only " +,-,×,/,(,)" these types of operators. Requirements: completion of the stack we must first determine whether the pair enter the expression in brackets in the right on the basis of the expression into postfix expression, then calculate the results.
To Search:
- [expression] - Expression evaluation: Using Stack reali
- [stack2] - converts to postfix from infix
- [exchange] - (1) implementation infix expression into
File list (Check if you may need any files):
main.c
Download