Hi the description of an assignment which I have to complete is shown below. I just need some help getting started, will I have to use a stack, queue, or both?
Write a program to recognize and evaluate prefix expressions. You can assume that operands are single digits, and the operators are +, -, *, /. Use a class for prefix expressions.
furthermore should I use an array or linked-list implementation
i'd vote for a queue based on a linked list, but the instructions you give don't limit it to that.
I'd also suggest a queue, however you can also use a binary tree.
I'd use a stack.
Definition: Politics -- Latin, from
poly meaning many and
tics meaning blood sucking parasites
-- Tom Smothers
