Prefix notation

[DasAllFolks]

Could this type of question appear on the exam?

"We have seen in class how to implement both postfix and infix
notation expressions using stacks; how could a prefix operation be
implemented using one or more of the data structures with which we are
already familiar?"

[Greg]

Yes and no.

This question form, in general is very good. But, there are two things
about it that would need to be tweaked:

1) We would ask about a specific data structure, for example,
an
expression tree, not any data structure.

2) Not all sections hit pre/in/post- fix as much as we did. Ditto
for
my offering of expression trees. So, these aren't likely to be
exam
topics.