• Courses
  • Tutorials
  • Jobs
  • Practice
  • Contests

GATE | GATE-CS-2002 | Question 44

To evaluate an expression without any embedded function calls :
 

(A)

As many stacks as the height of the expression tree are needed

(B)

One stack is enough

(C)

Two stacks are needed

(D)

A Turing machine is needed in the general case

Answer

Please comment below if you find anything wrong in the above post
Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!

Last Updated :
Share your thoughts in the comments