+1 vote
in Data Structures & Algorithms I by (110k points)
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 (408k points)
Correct answer is (b) two

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

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.