Web-Technologies
October 10, 2023Data-Structures
October 10, 2023Data-Structures
Question 18 |
Which of the following is essential for converting an infix expression to the postfix from efficiently?
An operator stack | |
An operand stack | |
An operand stack and an operator stack | |
A parse tree |
Question 18 Explanation:
An operator stack ⇒ Infix to (Postfix or Prefix)
An operand stack ⇒ Postfix to Prefix
Operator & operand stack ⇒ We don’t use two stacks
Parse tree ⇒ No use
An operand stack ⇒ Postfix to Prefix
Operator & operand stack ⇒ We don’t use two stacks
Parse tree ⇒ No use
Correct Answer: A
Question 18 Explanation:
An operator stack ⇒ Infix to (Postfix or Prefix)
An operand stack ⇒ Postfix to Prefix
Operator & operand stack ⇒ We don’t use two stacks
Parse tree ⇒ No use
An operand stack ⇒ Postfix to Prefix
Operator & operand stack ⇒ We don’t use two stacks
Parse tree ⇒ No use
Subscribe
Login
0 Comments