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?

  1. A.

    Tree

  2. B.

    Stack

  3. C.

    Linked list

  4. D.

    Queue

Attempted by 2805 students.

Sign up free to check your answer

Sign up free

Explore the full course: Rssb Senior Computer Instructor

Loading lesson…