Infix and Postfix
1. When evaluating a postfix expression, what data structure is commonly used to store intermediate results?
2. When a numeric operand is encountered while evaluating a postfix expression, what is normally done?
3. When a binary operator is encountered during postfix evaluation, what is the first major action?
4. What is the postfix evaluation result of ?
5. Why does operand order matter when evaluating a non-commutative operator such as subtraction?
6. What is the postfix evaluation of ?
7. Which postfix expression corresponds to the infix expression ?
8. For postfix expression , what value remains on the evaluation stack at the end?
9. What is the time complexity of evaluating a postfix expression containing tokens when each token is processed a constant number of times?