Scribd
Upload
106 views5 pages

Best Data Structure for Balanced Parentheses

The document discusses data structures for evaluating arithmetic expressions, specifically highlighting that a stack is the best choice for checking balanced parentheses. It also presents a postfix expression evaluation problem with multiple-choice answers. Additionally, there are references to specific answers and notations related to the evaluation process.

Uploaded by

sai
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
106 views5 pages

Best Data Structure for Balanced Parentheses

The document discusses data structures for evaluating arithmetic expressions, specifically highlighting that a stack is the best choice for checking balanced parentheses. It also presents a postfix expression evaluation problem with multiple-choice answers. Additionally, there are references to specific answers and notations related to the evaluation process.

Uploaded by

sai
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

The best data structure to check whether an arithmetic

expression has balanced parentheses is a


a. Stack
b. Queue
c. Tree
d. List

The result evaluating the postfix expression


10 5 + 60 6 / ∗ 8 − is
a. 284
b. 213
c. 142
d. 71
Answer : A B + C * D E * F / -

AB+c*-DE*F/-
Answer: S

ANSWER: 1, 8
ANSWER : posN-1

You might also like