• C

linked list rep. of stack

What is the code for a linked list rep. of a stack in C++.
Lost my code. need it though.
krnAsked:
Who is Participating?

[Product update] Infrastructure Analysis Tool is now available with Business Accounts.Learn More

x
I wear a lot of hats...

"The solutions and answers provided on Experts Exchange have been extremely helpful to me over the last few years. I wear a lot of hats - Developer, Database Administrator, Help Desk, etc., so I know a lot of things but not a lot about one thing. Experts Exchange gives me answers from people who do know a lot about one thing, in a easy to use platform." -Todd S.

alexoCommented:
This question sounds suspiciously like homework.  In that case t will be unethical for us to write it for you.  However, we can help with *specific* problems.

To get you started:

A stack usually implements two operations, PUSH - which pushes an item on the stack and POP - which returns the topmost item and removes it from the stack (sometimes the query and removal are split into two distinct operations).

An implementation using a linked-list can either add and remove items from the beginning of the list (if the list supports such operations) or keep a pointer to the last item.

Case #1:
  PUSH(item) - Add the new item to the beginning of the list.
  POP() - Return the first item and remove it from the list.

Case #2:
  PUSH(item) - Add the new item to the end of the list and update the pointer.
  POP() - Return the item pointed to (last item) and remove it from the list.

0
krnAuthor Commented:
Well in that case, I must decrease the points.
I will, on the pother hand, ask more questions about the problem as they arise.
0
baprebapCommented:
i will just write the POP and PUSH for you.
define a struvture as follows

struct  stacktype
{
 char *info;
 struct stacktype *link;;
};

allocate memory dynamically using the malloc() command.
firstnode is initialised to NULL in the main().the fn is invoked as
firstnode=push(firstnode,"KLJA');
pop is also called as above except that it does not take the char * field.
you may use typedef for struct stacktype * .it will be a better programming style.
pop may also be used to return the element deleted..to do so change the return type


struct stacktype *push(struct stacktype *firstnode,char *info)
{
 struct stacktype *newnode;
 newnode=(struct stacktype *)malloc(sizeof(stacktype));
 if (newnode==NULL) return(firstnode);
 strcpy(newnode->info,info);
 if (firstnode==NULL)
 {
  newnode->link=NULL:
  return(newnode);
 }
 else
 {
  newnode->link=firstnode;
  return(newnode);
 }
}

struct stacktype *pop(struct stacktype * firstnode)
{
 struct stacktype *save=firstnode;
 firstnode=firstnode->link;
 cout << "The element popped is ;" << save->info;
 free(save);
 return(firstnode);
}



0

Experts Exchange Solution brought to you by

Your issues matter to us.

Facing a tech roadblock? Get the help and guidance you need from experienced professionals who care. Ask your question anytime, anywhere, with no hassle.

Start your 7-day free trial
krnAuthor Commented:
Thanks
That is really what I was having problems with.
0
alexoCommented:
>> Well in that case, I must decrease the points.
You cannot decrease points for a question.  However, you can delete a question that has no pending or rejected answers and submit another one (that is the reason I gave a comment and not an "answer").

This is just for reference since I see you got your answer.
0
It's more than this solution.Get answers and train to solve all your tech problems - anytime, anywhere.Try it for free Edge Out The Competitionfor your dream job with proven skills and certifications.Get started today Stand Outas the employee with proven skills.Start learning today for free Move Your Career Forwardwith certification training in the latest technologies.Start your trial today
C

From novice to tech pro — start learning today.