- Computer Science Engineering (CSE)
- Data Structure (DS)
- The data structure required to evaluate ...

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

A. | queue |

B. | stacks |

C. | array |

D. | linked-list |

Answer» B. stacks |

View all MCQs in:
Data Structure (DS)

- Which of the following data structure is required to convert arithmetic expression in infix to its equivalent 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 ?
- Which of the following data structure is not linear data structure?
- What is the postfix form of the following prefix: *+ab–cd
- To perform level-order traversal on a binary tree, which of the following data structure will be required?
- Which data structure allows deleting data elements from and inserting at rear?
- Which of the following data structure can’t store the non-homogeneous data elements?
- A ……. is a data structure that organizes data similar to a line in the supermarket, where the first one in line is the first one out.
- Which data structure allows deleting data elements from front and inserting at rear?

Login to Continue

It will take less than 2 minutes

Report MCQ