# How many stacks are required for applying evaluation of infix expression algorithm?

+1 vote
How many stacks are required for applying evaluation of infix expression algorithm?

(a) one

(b) two

(c) three

(d) four

Question is taken from Evaluation of an Infix Expression (Not Parenthesized) in portion Application of Stacks of Data Structures & Algorithms I

The question was asked in homework.

## 1 Answer

+1 vote
by (506k points)
Correct answer is (b) two

Best explanation: Two stacks are required for evaluation of infix expression – one for operands and one for operators.

+1 vote
1 answer
+1 vote
1 answer
+1 vote
1 answer
+1 vote
1 answer
+1 vote
1 answer
+1 vote
1 answer
+1 vote
1 answer
0 votes
1 answer
+1 vote
1 answer
+1 vote
1 answer
+1 vote
1 answer
+1 vote
1 answer
+1 vote
1 answer
+1 vote
1 answer
+1 vote
1 answer
0 votes
1 answer
0 votes
1 answer
+1 vote
1 answer
+1 vote
1 answer
+1 vote
1 answer
+2 votes
1 answer
+1 vote
1 answer
+1 vote
1 answer
+2 votes
1 answer
+1 vote
1 answer