McqMate

Q. |
## The data structure required to evaluate a postfix expression is |

A. | queue |

B. | stacks |

C. | array |

D. | linked-list |

Answer» B. stacks |

4.7k

0

Do you find this helpful?

24

View all MCQs in

Data Structures (DS)No comments yet

- Which of the following data structure is required to convert arithmetic expression in infix to its equivalent postfix notation?
- Expression into postfix expression: (A - B) * (D / E)
- Which data structure is needed to convert infix notation to postfix notation?
- The postfix form of the expression (A + B)∗(C∗D − E)∗F / G is
- What is the postfix form of the following prefix expression -A/B*C$DE ?
- What is the value of the postfix expression 6 3 2 4 + – *?
- The postfix form of the expression (A+ B)*(C*D- E)*F / G is?
- The data structure required to check whether an expression contains balanced parenthesis is?
- The data structure required to check whether an expression contains balanced parenthesis is?
- Which of the following data structure is not linear data structure?