Hi,
How do I write a Program in āCā language to evaluate an expression using a Queue. You should not use the concept of Stack any where in your program.
Thanks in advance
Printable View
Hi,
How do I write a Program in āCā language to evaluate an expression using a Queue. You should not use the concept of Stack any where in your program.
Thanks in advance
Hi,
Use priority Q!
Oh another homework question.
A stack is a single-ended queue anyway as far as I know - but it's been a very long time since I did programming theory so give be a bit of a break.
I suppose what they mean is not to have Push and Pop.
But that's just AddHead/RemoveHead in double-ended queue terms anyway.
A stack is just a FILO (first in last out) queue I think.
So does the person only want you to use FIFO (first in first out) queues or what ?
Darwen.