+1 vote
in Data Structures & Algorithms I by (110k points)
To convert the postfix expression into the infix expression we use stack and scan the postfix expression from left to right.

(a) True

(b) False

My question is from Application of Stacks in division Application of Stacks of Data Structures & Algorithms I

The question was asked in a national level competition.

1 Answer

+1 vote
by (408k points)
selected by
 
Best answer
The correct option is (a) True

Easy explanation - Stack is used to postfix expression to infix expression. And to convert we follow the following steps: (i) Scan the expression from left to right. (ii) If operand is found, push it on stack.(iii) If operator is found, the two operands are popped and the combined infix expression is formed and pushed onto the stack.

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.

Categories

...