Description: Requirements: to construct an expression tree, when the input infix expression, output and print the prefix and suffix expression
To achieve: constructing a standard expression tree, it covers the first order, in sequence, after the traversal operation, through the printing operation sequence to achieve the conversion operation; compared with the use of the stack to convert, eliminates the inverse operation of the infix turn into a prefix
To Search:
File list (Check if you may need any files):
InFix2PostFixorPreFix.cpp
Download