To evaluate an expression without any embedded function calls :

GATE · Computer Science · 2002

1. A.

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

2. B.

   One stack is enough

3. C.

   Two stacks are needed

4. D.

   A Turing machine is needed in the general case

Attempted by 1088 students.

The worked solution is available to enrolled students.