Use Linked-List Stack to Print Backwards

[LibLife]

Hi, I am trying to use linked-list to print a sentence backwards.
I got my program to run, but I am not getting the right output (it's not printing backwards).
How can I fix this problem?

Thank you!

#ifndef STACKS_H
#define STACKS_H

#include<string>
#include<stack>
#include<iostream>
using namespace std;

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


class linkedStackType
{
public:
	void initializeStack();
	bool isEmptyStack();
	void push(const char& newItem);
	char top();
	void pop();
	linkedStackType();
	//linkedStackType(const linkedStackType & otherStack);
	//~linkedStackType();
private:
	nodeType * stackTop;
};

#endif // STACKS_H

//Stacks.cpp file

#include<stack>
#include<string>
#include "Stacks.h"
#include<iostream>
using namespace std;


//Empty Stack
bool linkedStackType::isEmptyStack()
{
	return (stackTop == NULL);
}

//Default Constructor
linkedStackType::linkedStackType()
{
	stackTop = NULL;
}

//Destroy Stack
void linkedStackType::initializeStack()
{
	nodeType * temp;
	while (stackTop != NULL)
	{
		temp = stackTop;
		stackTop = stackTop->link;
		delete temp;
	}
}


void linkedStackType::push(const char & newElement)
{
    nodeType  *newNode;                         //pointer to create the new node
    newNode = new nodeType;                     //create the node
    newNode->info = newElement;                 //store newElement in the node
    newNode->link = stackTop;                   //insert newNode before stackTop
    stackTop = newNode;                        //set stackTop to point to the

}

char linkedStackType::top()
{
    //assert(stackTop != NULL);                       //if stack is empty,
                                                    //terminate the program
    return stackTop->info;                          //return the top element
}

void linkedStackType::pop()
{
    nodeType *temp;                           //pointer to deallocate memory
    if (stackTop != NULL)
    {
        temp = stackTop;                                 //set temp to point to the top node
        stackTop = stackTop->link;                      //advance stackTop to the
                                                        //next node
        delete temp;                                    //delete the top node
    }
    else
    cout << "Cannot remove from an empty stack." << endl;
}


//mIn.cpp file

#include "Stacks.h"
#include<stack>
#include<string>
#include<iostream>
using namespace std;

int main()
{
    char Words;
    linkedStackType stack;
    cout << "Please enter a sentence. \n";
    cin.get(Words);

    stack.push(Words);


    while(!stack.isEmptyStack())
    {
        cout <<stack.top() << " ";
        stack.pop();
    }
    return 0;
}

[integralfx]

    char Words;
    linkedStackType stack;
    cout << "Please enter a sentence. \n";
    cin.get(Words);

You're telling the user to enter in a string but you're storing the string in a char.

[xenoviaquarta]

the problem is not in your stack, it is in the input, it only stores the first letter of input sentence to Words, therefore it only pushes the first letter of the sentence into the stack

EDIT: even if you do, you need to split the words in the sentence first before pushing it to the stack

[Thomas1965]

Best way is to store the input in a string, loop through it and add each char to the stack.

int main ()
{
  string input;

  linkedStackType stack;
  cout << "Please enter a sentence. \n";
  getline (cin, input);

  for (char ch : input)
  {
    stack.push (ch);
  }


  while (!stack.isEmptyStack ())
  {
    cout << stack.top () << " ";
    stack.pop ();
  }
  system("pause");
  return 0;
 
}

[LibLife]

It worked.
Thanks a lot.