Which of the following data structures is most suitable for evaluating postfix…
KVS PGT Computer Science · 2017 · PGT Computer Science · Computer Science subject component
Which of the following data structures is most suitable for evaluating postfix expressions?
- A.
Tree
- B.
Stack
- C.
Linked list
- D.
Queue
Attempted by 2805 students.
Sign up free to check your answer
Sign up freeLoading lesson…