Thread: stack project

Originally Posted by dwks

Actually, pushing something onto a stack is "placing it on top". popping something removes it.

Well, yeah, but it doesn't necessarily mean taking an element not in the stack and placing it on top. You can also "push" elements of a stack to the top. That's why I thought the terminology wasn't quite correct.

But anyways, winky, you're getting closer to what you're looking for. All the pushes in the code you just put up are unnecessary. You should be popping values off of your stacks.

You said:

Originally Posted by Happy_Reaper

Ok, you seem to be slowly cathing the concept. The one problem that you have with the code up here is that you're placing (and for the record, "pushing" something in a stack is not placing it on top...) the result back on top of the stack.

But you're wrong. A 'push' does in fact place something on top of the stack. That's the only method a stack uses to add something. "Inserting" isn't the same as "pushing". Also, if you're using insertion, then you're no longer following the rules that are the very nature of a stack. A stack doesn't have to care where you're pushing something from, what the source of it is. All it cares about is if you push something, it goes on top, and if you pop something, it comes off of the top.

A queue works the exact same way, except the 'pop' removes the bottom item. The 'push' however, still places it on top.


Quzah.

is there anyone I can pay on here to do the two assignments I have posted for me? I am going to be on thanksgiving break next week and that's when it is due. where I will I be I won't have access to the internet which is what I need to compile and I have no clue how to finish either of these projects.